Batch processing with interval graph compatibilities between tasks

Discrete Applied Mathematics

Volumn 156, Issue 5, 2008, Pages 556-568

  Finke, Gerd ^a   Jost, Vincent ^a   Queyranne, Maurice ^a   Sebo, András ^a  

^a Laboratoire Leibniz   (France)

Author keywords

Batch scheduling; Bounded coloring; Interval graphs; Max coloring; Perfect graphs; Task compatibilities

Indexed keywords

BINARY SEQUENCES; INDUSTRIAL ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

BATCH-SCHEDULING; BOUNDED COLORING; INTERVAL GRAPHS; MAX-COLORING; PERFECT GRAPHS; TASK COMPATIBILITIES;

GRAPH THEORY;

EID: 39049132800     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.03.039     Document Type: Article

References (29)

1. Bodlaender H.L., and Jansen K. Restrictions of graph partition problems, part I. Theoret. Comput. Sci. 148 1 (1995) 93-109
2. C. Bornstein, J.L. Szwarcfiter, Personal communication, Rio de Janeiro, November 2003.
3. M. Boudhar, Static scheduling on a single batch processing machine with split compatibility graphs, Cahier No. 28, Laboratoire Leibniz, Grenoble, 2001.
4. Boudhar M. Scheduling a batch processing machine with bipartite compatibility graphs. Math. Methods Oper. Res. 57 (2003) 327-513
5. Boudhar M. Dynamic scheduling on a single batch processing machine with split compatibility graphs. J. Math. Modelling Algorithms 2 (2003) 17-35
6. M. Boudhar, G. Finke, Scheduling on batch processing machines with constraints of compatibility between jobs, in: Proceedings of the Second Conference on Management and Control of Production and Logistics (MCPL'2000), vol. 2, Grenoble, 2000, pp. 703-708.
7. Boudhar M., and Finke G. Scheduling on a batch machine with job compatibilities. Belgian J. Oper. Res. Statist. Comput. Sci. 40 (2000) 69-80
8. Brauner N., Dhaenens-Flipo C., Espinouse M.-L., Finke G., and Gavranovic H. Decomposition into parallel work phases with application to the sheet metal industry. Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM'99) vol. 1 (1999), Glasgow 389-396
9. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C., Tautenhahn T., and van de Velde S. Scheduling a batching machine. J. Scheduling 1 (1998) 31-54
10. P. Brucker, S. Knust, Complexity results of scheduling problems, 〈www.mathematik.uni-osnabrueck.de/research/OR/class/〉.
11. Demange M., de Werra D., Monnot J., and Paschos V.T. Time slot scheduling of compatible jobs, Cahier du Lamsade No. 182, Université Paris IX (2001), Dauphine, Paris
12. E. Desgrippes, C. Rapine, Personal communication, Grenoble, November 2003.
13. B. Escoffier, Approximation polynomiale de problèmes d'optimisation: Aspects structurels et opérationnels, Ph.D. Thesis, Laboratoire LAM-SADE, Paris Dauphine, 2005.
14. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco, CA
15. F. Gardi, Ordonnancement avec exclusion mutuelle par un graphe d'intervalle ou une classe apparentée: complexité et algorithmes, Ph.D. Thesis, Laboratoire d'informatique fondamentale, Faculté des sciences de Luminy, 2005.
16. H. Gavranovic, Affectation de fréquences et conception optimale d'une ligne de production: modèles et algorithmes de résolution, Ph.D. Thesis, Université Joseph Fourier, Grenoble, 2002.
17. Gavranovic H., and Finke G. Graph partitioning and set covering for the optimal design of a production system in the metal industry. Proceedings of the Second Conference on Management and Control of Production and Logistics (MCPL'2000) vol. 2 (2000), Grenoble 603-608
18. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York
19. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer, Berlin
20. Hansen P., Hertz A., and Kuplinsky J. Bounded vertex colorings of graphs. Discrete Math. 111 (1993) 305-312
21. Hochbaum D.S. Approximation Algorithms for NP-Hard Problems (1995), PWS Publishing Company
22. Hochbaum D.S., and Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime. Oper. Res. 45 (1997) 874-885
23. Jansen K. The mutual exclusion scheduling problem for permutation and comparability graphs. Inform. and Comput. 180 2 (2003) 71-81
24. V. Jost, Ordonnancement chromatique: Polyédres, Complexité et Classification, Ph.D. Thesis, Laboratoire Leibniz, UJF, Grenoble, 2006.
25. P.L. Nguyen, Planification tactique de la production: approche hiérarchisée pour une classe d'entreprises de sous-traitance et application au cas de laminage à froid, Ph.D. Thesis, Université Joseph Fourier, Grenoble, 1997.
26. Papadimitriou C.H., and Yannakakis M. Scheduling interval-ordered tasks. SIAM J. Comput. 8 (1979) 405-409
27. S.V. Pemmaraju, R. Ramman, Approximation algorithms for the max-coloring problem, ICALP'05, 2005, accepted for publication.
28. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. European J. Oper. Res. 120 (2000) 228-240
29. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency (2003), Springer, Berlin