A modified LPT algorithm for the two uniform parallel machine makespan minimization problem

European Journal of Operational Research

Volumn 196, Issue 1, 2009, Pages 61-68

  Koulamas, Christos ^a   Kyparisis, George J ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Approximation algorithms; LPT; Scheduling; Uniform parallel machines

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; MACHINE SHOPS; OPTIMIZATION; PARALLEL ALGORITHMS;

LONGEST PROCESSING TIMES; LPT; LPT ALGORITHMS; MAKESPAN MINIMIZATIONS; UNIFORM MACHINES; UNIFORM PARALLEL MACHINES;

APPROXIMATION ALGORITHMS;

EID: 56549109280     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.02.008     Document Type: Article

References (6)

1. Epstein L., and Favrholdt L.M. Optimal non-preemptive semi-online scheduling on two related machines. Journal of Algorithms 57 (2005) 49-73
2. Gonzalez T., Ibarra O.H., and Sahni S. Bounds for LPT schedules on uniform processors. SIAM Journal on Computing 6 (1977) 155-166
3. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17 (1969) 416-429
4. Koulamas C., and Kyparisis G.J. A heuristic for maximizing the number of on-time jobs on two uniform parallel machines. Naval Research Logistics 53 (2006) 568-575
5. Koulamas C., and Kyparisis G.J. An improved delayed-start LPT algorithm for scheduling two identical parallel machines. European Journal of Operational Research 187 (2008) 660-666
6. Mireault P., Orlin J.B., and Vohra R.V. A parametric worst case analysis of the LPT heuristic for two uniform machines. Operations Research 45 (1997) 116-125