Lot streaming and scheduling heuristics for m -machine no-wait flowshops

  title={Lot streaming and scheduling heuristics for m -machine no-wait flowshops},
  author={S. Kumar and T. P. Bagchi and Chelliah Sriskandarajah},
  journal={Computers & Industrial Engineering},
  • S. Kumar, T. P. Bagchi, Chelliah Sriskandarajah
  • Published 2000
  • Mathematics
  • Computers & Industrial Engineering
  • Abstract The objective of this paper is to minimize makespan in m -machine no-wait flowshops with multiple products requiring lot streaming. A ‘product’ here implies many identical items. ‘Lot streaming’ creates sublots to move the completed portion of a production lot to downstream machines so that machine operations can be overlapped. For the single product case with fixed number of sublots we obtain optimal continuous-sized sublots and then use a heuristic to find integer-sized sublots. For… CONTINUE READING
    103 Citations
    Lot streaming in no-wait flowshops with one machine never idle
    • E. Wagneur
    • Engineering
    • Proceedings of the 2001 IEEE International Conference on Control Applications (CCA'01) (Cat. No.01CH37204)
    • 2001
    • 1
    Lot streaming in a multiple product permutation flow shop with intermingling
    • 37
    • Highly Influenced
    • PDF
    Heuristic search algorithms for lot streaming in a two-machine flowshop
    • 17