A heuristic algorithm for two-machine re-entrant shop scheduling

@article{Drobouchevitch1999AHA,
  title={A heuristic algorithm for two-machine re-entrant shop scheduling},
  author={Inna G. Drobouchevitch and Vitaly A. Strusevich},
  journal={Annals OR},
  year={1999},
  volume={86},
  pages={417-439}
}
This paper considers the problem of sequencing n jobs in a two-machine re-entrant shop with the objective of minimizing the maximum completion time. The shop consists of two machines, M1 and M2, and each job has the processing route (M1, M2, M1). An O(n log n) time heuristic is presented which generates a schedule with length at most 4y3 times that of an optimal schedule, thereby improving the best previously available worst-case performance ratio of 3y2. 
BETA

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…