论文信息 - Solvable cases of the flow‐shop problem without interruptions in job processing

Solvable cases of the flow‐shop problem without interruptions in job processing

This article examines solvable cases of the flow‐shop problem without interruptions in job processing where the completion time is being minimized. All those cases utilize Gilmore‐Gomory's algorithm. A lower completion time bound is also provided.

Wlodzimierz Szwarc | W. Szwarc

[1] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[2] Wlodzimierz Szwarc,et al. A note on the flow‐shop problem without interruptions in job processing , 1981 .

[3] S. S. Panwalkar,et al. Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case , 1979 .