The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.
- Approximation scheme
ASJC Scopus subject areas
- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics
- Modelling and Simulation