Batch processing with interval graph compatibilities between tasks
- 1 March 2008
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 156 (5), 556-568
- https://doi.org/10.1016/j.dam.2006.03.039
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation Algorithms for the Max-coloring ProblemLecture Notes in Computer Science, 2005
- Scheduling a batch processing machine with bipartite compatibility graphsMathematical Methods of Operations Research, 2003
- The mutual exclusion scheduling problem for permutation and comparability graphsInformation and Computation, 2003
- Scheduling on Batch Processing Machines with Constraints of Compatibility Between JobsIFAC Proceedings Volumes, 2000
- Graph Partitioning and Set Covering for the Optimal Design of a Production System in the Metal IndustryIFAC Proceedings Volumes, 2000
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- Scheduling Semiconductor Burn-In Operations to Minimize Total FlowtimeOperations Research, 1997
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Bounded vertex colorings of graphsDiscrete Mathematics, 1993
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979