| Article ID: | iaor20013280 |
| Country: | Germany |
| Volume: | 51 |
| Issue: | 3 |
| Start Page Number: | 495 |
| End Page Number: | 513 |
| Publication Date: | Jan 2000 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Wanke E., Espelage W. |
| Keywords: | flowshop, buffer allocation |
We consider the movement minimization problem in a conveyor 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 conveyor controlled manufacturing systems.