Movement minimization for unit distances in conveyor flow shop processing

W. Espelage and E. Wanke

Mathematical Methods of Operations Research, 2003, vol. 57, issue 2, 173-206

Abstract: We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a buffer. The objective is to minimize the total number of movements of the worker for the processing of all jobs. Such minimization problems usually appear in conveyor controlled manufacturing systems. We show the NP-completeness of the problem and introduce an approximation algorithm with error ratio 2. Copyright Springer-Verlag Berlin Heidelberg 2003

Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200249 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:57:y:2003:i:2:p:173-206

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200249

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().