A Heuristic Algorithm for a Two-Machine Flowshop Scheduling Problem with a Bounded Intermediate Station

@inproceedings{Hata2004AHA,
  title={A Heuristic Algorithm for a Two-Machine Flowshop Scheduling Problem with a Bounded Intermediate Station},
  author={Yusuke Hata and Yoshiyuki Karuno and Hiroshi Kise},
  year={2004}
}
In this paper we deal with a two-machine robotic unit of flowshop type, in which each ofn jobs is processed on the first machine and later on the second machine. Transportation of the jobs in this flowshop is performed by robots. There is an intermediate station with its capacity bound Q(1〓Q 〓∞) between the two machines for intermediate operations such as washing, chip disposal, cooling, drying and/or quenching. The bounded intermediate station can process at most Q jobs at a time. The… CONTINUE READING