Abstract
This note proposes and analyzes a posterior tight worst-case bound for the longest processing time (LPT) heuristic for scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. It makes natural remarks on the well-known posterior worst-case bounds, and shows that the proposed bound can complement the well-known posterior bounds to synergistically achieve a better posterior worst-case bound for the LPT heuristic. Moreover, it gives some insight on LPT asymptotical optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blocher JD, Chand S (1991) Scheduling of parallel processors: a posterior bound on LPT sequencing and a two-step algorithm. Naval Res Logist 38:273–287
Blocher JD, Sevastyanov S (2015) A note on the Coffman–Sethi bound for LPT scheduling. J Sched 18:325–327
Chen B (1993) A note on LPT scheduling. Oper Res Lett 14:139–142
Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du DZ, Pardalos P (eds) Handbook of combinatorial optimization, vol 3. Kluwer Academic, Dordrecht, pp 21–169
Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47:271–292
Coffman EG Jr, Garey MR, Johnson DS (1978) An application of bin-paking to multiprocessor scheduling. SIAM J Comput 7:1–17
Coffman EG Jr, Lueker GS, Rinnooy Kan AHG (1988) Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics. Manag. Sci. 34:266–290
Coffman EG Jr, Sethi R (1976) A generalized bound on LPT sequencing. RAIRO Inf 10:17–25
Dell’Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7:191–200
Frenk JBG, Rinnooy Kan AHG (1986) The rate of convergence to optimality of the LPT rule. Discrete Appl Math 14:187–197
Frenk JBG, Rinnooy Kan AHG (1987) The asymptotic optimality of the LPT rule. Math Oper Res 12:241–254
Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco
Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563–1581
Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416–429
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Gupta JND, Ruiz-Torres AJ (2001) LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28–36
Ibarra OH, Kim CE (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J Assoc Comput Mach 24:280–289
Karmarkar N, Karp RM (1982) The differencing method of set partitioning. Technical report UCB/CSD 82/113. University of California, Berkeley
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH (eds) Handbooks in operations research and management science, vol 4. Elsevier Science Publishers B.V., Amsterdam
Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233–242
Massabò I, Paletta G, Ruiz-Torres AJ (2016) A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem. J Sched 19(2):207–211
Mokotoff E (2001) Parallel machine scheduling problem: a survey. Asia Pac J Oper Res 18:193–242
Paletta G, Pietramala P (2007) A new approximation algorithm for the nonpreemptive scheduling of independent jobs on identical parallel processors. SIAM J Discrete Math 21:313–328
Paletta G, Vocaturo F (2010) A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm. SIAM J Discrete Math 23:2198–2203
Acknowledgements
The authors are very grateful to the Editor-in-Chief Silvano Martello, and the anonymous referees for their helpful comments and encouraging advice.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ho, J.C., Massabò, I., Paletta, G. et al. A note on posterior tight worst-case bounds for longest processing time schedules. 4OR-Q J Oper Res 17, 97–107 (2019). https://doi.org/10.1007/s10288-018-0381-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-018-0381-7