Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines

Operations Research Letters

Volumn 32, Issue 4, 2004, Pages 326-330

  Tercinet, F ^a   Lente C ^a   Neron E ^a  

^a UNIVERSITÉ DE TOURS   (France)

Author keywords

Energetic reasoning; Identical parallel machines; Preemptive relaxation

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; SET THEORY;

ENERGETIC REASONING (ER); IDENTICAL PARALLEL MACHINES; PREEMPTIVE APPROACH (PR); PREEMPTIVE RELAXATION;

OPERATIONS RESEARCH;

EID: 2042503732     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.08.008     Document Type: Article

References (7)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network flows: Theory, Algorithms and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. Baptiste Ph., Le Pape C., Nuijten W. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92:1999;305-333.
3. Brucker P. Scheduling Algorithms. 1995;Springer, Berlin.
4. max scheduling problem Ann. Oper. Res. 83:1998;41-58.
5. Gharbi A., Haouari M. Minimizing makespan on parallel machines subject to release dates and delivery times. J. Scheduling. 5:2002;329-355.
6. Haouari M., Gharbi A. An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper. Res. Lett. 31:2003;49-52.
7. Horn W.A. Some simple scheduling algorithms. Naval Res. Logist. Quarterly. 21:1974;177-185.