Movement optimization in flow shop processing with buffers

Wolfgang Espelage and Egon Wanke

Mathematical Methods of Operations Research, 2000, vol. 51, issue 3, 495-513

Abstract: We consider the movement minimization problem in a conveyer flow shop processing controlled by one worker that has to serve all machines. Each machine can only execute tasks if the worker is present. A few jobs can be queued in a buffer in front of each machine. The objective is to minimize the movement of the worker, which is how often the worker has to change the machines for the processing of all jobs. Such minimization problems usually appear in conveyer controlled manufacturing systems. Copyright Springer-Verlag Berlin Heidelberg 2000

Keywords: Key words: Flow shop processing; problem complexity; movement optimization; discrete algorithms (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000044 (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:51:y:2000:i:3:p:495-513

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

DOI: 10.1007/s001860000044

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 ().