Maximizing the minimum completion time on parallel machines

4OR

Volumn 6, Issue 4, 2008, Pages 375-392

  Haouari, Mohamed ^a   Jemmali, Mahdi ^b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Branch and bound; Identical parallel machines; Scheduling

Indexed keywords

EID: 57049164903     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-007-0053-5     Document Type: Article

References (11)

1. Y Azar L Epstein 1997 On-line machine covering Lect Notes Comput Sci 1284 23 36
2. J Csirik H Kellerer G Woeginger 1992 The exact LPT-bound for maximizing the minimum completion time Oper Res Lett 11 281 287
3. M Dell'Amico S Martello 1995 Optimal scheduling of tasks on identical parallel processors ORSA J Comput 7 191 200
4. BL Deuermeyer DK Friesen MA Langston 1982 Scheduling to maximize the minimum processor finish time in a multiprocessor system SIAM J Algorithms Discret Methods 3 190 196
5. M Haouari A Gharbi 2004 Lower bounds for scheduling on identical parallel machines with heads and tails Ann Oper Res 129 187 204
6. M Haouari A Gharbi M Jemmali 2006 Tight bounds for the identical parallel machine scheduling problem Int Trans Oper Res 13 529 548
7. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SS, Rinnooy Kan AHG, Zipkin P (eds) Handbooks in operations research and management science, vol 4, pp 445-522
8. D Pisinger 2003 Dynamic programming on the word RAM Algorithmica 35 437 459
9. HD Sherali JC Smith 2001 Improving discrete model representations via symmetry considerations Manage Sci 47 1396 1407
10. ZY Tan Y He 2002 Ordinal on-line scheduling for maximizing the minimum machine completion time J Comb Optim 6 199 206
11. GJ Woeginger 1997 A polynomial time approximation scheme for maximizing the minimum completion time Oper Res Lett 20 149 154