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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Additional information
Manuscript received: June 1999 / final version received: October 1999
Rights and permissions
About this article
Cite this article
Espelage, W., Wanke, E. Movement optimization in flow shop processing with buffers. Mathematical Methods of OR 51, 495–513 (2000). https://doi.org/10.1007/s001860000044
Issue Date:
DOI: https://doi.org/10.1007/s001860000044