Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms
- 12 April 2022
- journal article
- research article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 309, 103711
- https://doi.org/10.1016/j.artint.2022.103711
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Class constrained bin packing revisitedTheoretical Computer Science, 2010
- A survey of scheduling problems with setup times or costsEuropean Journal of Operational Research, 2008
- Polynomial time approximation schemes for class-constrained packing problemsJournal of Scheduling, 2001
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Scheduling identical jobs on uniform parallel machinesStatistica Neerlandica, 1990
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954