Minimizing makespan for multi-spindle head machines with a mobile table

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 344-357

  Guschinskaya, Olga ^a   Dolgui, Alexandre ^a   Guschinsky, Nikolai ^b   Levin, Genrikh ^b  

^a ECOLE DES MINES DE SAINT ETIENNE   (France)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Batch processing; Compatibility of jobs; Exclusion and inclusion constraints; Graph theory; Precedence constraints; Scheduling

Indexed keywords

RESEARCH; SCHEDULING;

BATCH PROCESSING; BATCH PROCESSING MACHINES; BATCH TIME; COMPATIBILITY OF JOBS; CONSTRAINED SHORTEST PATH; EXCLUSION AND INCLUSION CONSTRAINTS; GRAPH THEORY; MAKESPAN; MINIMIZING MAKESPAN; MULTI-SPINDLE; OPERATIONAL RESEARCH; PRECEDENCE CONSTRAINTS;

INDUSTRIAL RESEARCH;

EID: 52049102962     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.10.010     Document Type: Article

References (26)

1. Hitomi K. Manufacturing Systems Engineering (1996), Taylor & Francis, London
2. In: Dashchenko A.I. (Ed). Manufacturing Technologies for Machines of the Future. 21st Century technologies (2003), Springer, Berlin
3. Dolgui A, Guschinsky N, Levin G. Graph approach for design of unit-head machines with a rotary table. In: Proceedings of second international workshop on discrete optimization methods in production and logistics, Omsk-Irkutsk, 2004. p. 136-41.
4. Dolgui A., Finel B., Vernadat F., Guschinsky N., and Levin G. A heuristic approach for transfer lines balancing. Journal of Intelligent Manufacturing 16 2 (2005) 159-172
5. Dolgui A., Guschinskaya O., Guschinsky N., and Levin G. Conception de systèmes de fabrication: prototype d'un logiciel d'aide à la décision. Journal of Decision Systems 14 4 (2005) 489-516
6. Dolgui A., Finel B., Guschinskaya O., Guschinsky N., Levin G., and Vernadat F. Balancing large-scale machining lines with multi-spindle heads using decomposition. International Journal of Production Research 44 18-19 (2006) 4105-4120
7. Dolgui A., Guschinsky N., and Levin G. A special case of transfer lines balancing by graph approach. European Journal of Operational Research 168 (2006) 732-746
8. Dolgui A., Finel B., Guschinsky N., Levin G., and Vernadat F. MIP approach to balancing transfer lines with blocks of parallel operations. IIE Transactions 38 (2006) 869-882
9. Guschinskaya O, Dolgui A, Guschinsky N, Levin G. A heuristic multi-start decomposition approach for optimal design of serial machining lines. European Journal of Operational Research, 2007; doi:10.1016/j.ejor.2006.03.072.
10. Guschinskaya O, Dolgui A. Equilibrage des lignes d'usinage: la résolution des problèmes de grande taille. Rapport de recherche 2006-500-11, EMSE, Saint-Etienne, France, 2007.
11. Dolgui A, Guschinskaya O, Guschinsky N, Levin G. Optimization in design of unit head machines with a mobile table. In: Dolgui A, Morel G, Pereira G, editors. Information control problems in manufacturing 2006: a proceedings volume from the 12th IFAC international symposium, vol. 2, St Etienne, France, 17-19 May 2006. Amsterdam: Elsevier Science; 2006. p. 413-8 [ISBN: 978-0-08-044654-7].
12. Potts C.N., and Kovalyov M. Scheduling with batching: a review. European Journal of Operational Research 120 (2000) 228-249
13. Sung C.S., and Kim Y.H. Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers and Operations Research 29 (2002) 275-294
14. Gribkovskaia I., Lee C.Y., Strusevich V., and deWerra D. Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters 34 (2006) 459-464
15. Schaller J. Scheduling on a single machine with family setups to minimize total tardiness. International Journal of Production Economics 105 (2007) 329-344
16. Cheng T.C.E., Yuan J.J., and Yang A.F. Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers and Operations Research 32 (2005) 849-859
17. Gupta A.K., and Sivakumar A.I. Optimization of due-date objectives in scheduling semiconductor batch manufacturing. International Journal of Machine Tools and Manufacture 46 (2006) 1671-1679
18. Koh S.G., Koo P.H., Kim D.C., and Hur W.S. Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. International Journal of Production Economics 98 (2005) 81-96
19. Oulamara A., and Finke G. Flowshop problems with two batch processing machines. International Journal of Mathematical Algorithms 2 (2001) 269-287
20. Oulamara A. Makespan minimization in a no-wait flow shop problem with two batching machines. Computers and Operations Research 34 (2007) 1033-1050
21. Azizoglu M., and Webster S. Scheduling a batch processing machine with incompatible job families. Computers and Industrial Engineering 39 3-4 (2001) 325-335
22. Yuan J.J., Liu Z.H., Ng C.T., and Cheng T.C.E. The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science 320 (2004) 199-212
23. Monch L., Balasubramanian H., Fowler J.W., and Pfund M.E. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers and Operations Research 32 (2005) 2731-2750
24. Malve S, Uzsoy R. A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Computers and Operations Research 2007;34:3016-28.
25. Pedersen C.R., Rasmussen R.V., and Andersen K.A. Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search. Computers and Operations Research 34 (2007) 2025-2042
26. Sotskov Y.N., Dolgui A., and Werner F. Mixed graph coloring for unit-time job-shop scheduling. International Journal of Mathematical Algorithms 2 (2001) 289-323