Skip to main content
Log in

Movement optimization in flow shop processing with buffers

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: June 1999 / final version received: October 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860000044

Navigation