Study of Scheduling Problems with Machine Availability Constraint
نویسندگان
1 Young Researchers Club, Tehran’s Science and Research Branch, Islamic Azad University, Tehran, Iran
2 Faculty of Accounting and Management, Allameh Tabataba’i University, Tehran, Iran
doi
چکیده
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature will be completely reviewed and the NP-complete models will be identified.
