Flowshop scheduling with limited temporary storage

@article{Papadimitriou1980FlowshopSW,
  title={Flowshop scheduling with limited temporary storage},
  author={Christos H. Papadimitriou and Paris C. Kanellakis},
  journal={J. ACM},
  year={1980},
  volume={27},
  pages={533-549}
}
We examine the problem of scheduling 2-machine flowshops in order to minimize makespan, using a limited amount of intermediate storage buffers. Although there are efficient algorithms for the extreme cases of zero and infinite buffer capacities, it is shown that all the intermediate (finite-capacity) cases are NP-complete. Exact bounds are proved for the relative improvement of execution times when a given buffer capacity is used. An efficient heuristic for solving the I-buffer problem is also… CONTINUE READING
68 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 68 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…