An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

@article{Wang2007AnAS,
  title={An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint},
  author={Xiuli Wang and T. C. Edwin Cheng},
  journal={Computers & OR},
  year={2007},
  volume={34},
  pages={2894-2901}
}
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

A two-machine flowshop with unavailability interval on the second machine

  • 2015 12th International Conference on Service Systems and Service Management (ICSSSM)
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Comparative analysis the simultaneous scheduling problems of production and maintenance activities

  • 2018 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.