Preemptive scheduling in the presence of transportation times

Computers and Operations Research

Volumn 36, Issue 8, 2009, Pages 2387-2393

  Boudhar, Mourad ^a   Haned, Amina ^a  

^a UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

Author keywords

Complexity; Heuristics; Identical parallel machines; Makespan; Migration delay; Preemption; Transportation time

Indexed keywords

CONTROL THEORY; HEURISTIC METHODS; LINEARIZATION; SCHEDULING;

COMPLEXITY; HEURISTICS; IDENTICAL PARALLEL MACHINES; MAKESPAN; MIGRATION DELAY; PREEMPTION; TRANSPORTATION TIME;

BUSINESS MACHINES;

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

References (13)

1. Fishkin AV, Jansen K, Sevastyanov SV, Sitters R. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. Lecture notes in computer science, vol. 3669; 2005. p. 580-91.
2. Baker K.R. Introduction to sequencing and scheduling (1974), Wiley, New York
3. Blazewicz J. Selected topics in scheduling theory. Annals of Discrete Mathematics 31 (1987) 1-60
4. Blazewicz J., Ecker K.H., Pesch E., Schmidt G., and Weglarz J. Scheduling computer and manufacturing processes (1996), Springer, Berlin
5. Blazewicz J., Ecker K.H., Schmidt G., and Weglarz J. Scheduling in computer and manufacturing systems (1994), Springer-Lehrbuch, Berlin
6. Brucker P. Scheduling algorithms (1995), Springer, Berlin
7. Brucker P, Knust S. Complexity results of scheduling problems, page web, 2007 〈http://www.mathematik.uni-osnabrueck.de/research/OR/class/〉.
8. Berit J. Scheduling parallel jobs to minimize the makespan. Journal of Scheduling 9 (2006) 433-452
9. Chu C., and Yalaoui F. An efficient heuristic approach for parallel machine scheduling with job splitting and sequence dependent setup times. IIE Transactions 35 (2003) 183-190
10. Boustta M. Minimisation du temps de fabrication sur une machine à injection avec réglages multiples, Thèse, Université Laval, Québec; 2003.
11. Adjallah KH, Bettayeb B, Kacem I. Ordonnancement sur machines parallèles identiques avec temps de préparation par famille: application à la gestion des tâches de maintenance préventive. 6e Conférence Francophone de MOdélisation et SIMulation (MOSIM'06), Rabat, 2006.
12. Jansen K., Mastrolilli M., and Solis-Oba R. Approximation algorithms for flexible job shop problems. International Journal of Foundations of Computer Science 16 2 (2005) 361-379
13. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman and Company, San Francisco