Abstract
A new polynomial algorithm is developed for the classical multiprocessor scheduling problem in which independent jobs are nonpreemptively scheduled on identical parallel machines with the objective of minimizing the makespan, i.e. the latest job finishing time. The algorithm at first generates and merges a set of partial solutions in order to obtain a feasible solution for the multiprocessor scheduling problem. Then a set of bin packing problems are solved in order to improve the solution, by iteratively using a M u l t i F i t type procedure on different job sets. The effectiveness of this approach is evaluated by solving a large number of benchmark instances. The results indicate that the proposed algorithm, called PSMF, is very competitive with well known constructive algorithms for a wide range of instances. Furthermore, PSMF is competitive with respect to some of the best heuristics for parallel machine scheduling problems only when it uses a 2-exchange procedure.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10, 205–229 (2004)
Alvim, A.C.F., Ribeiro, C.C.: A hybrid bin-packing heuristic to multiprocessor scheduling. In: Ribeiro, C.C., Martins, S.L. (eds.) Lecture Notes in Computer Science 3059, pp. 1–13. Springer-Verlag (2004a)
Alvim, A.C.F., Ribeiro, C.C.: A hybrid bin-packing heuristic to multiprocessor scheduling: Detailed computational results. http://www.uniriotec.br/~adriana/files/detPCmaxIN.pdf (2004b)
Blazewicz, J.: Selected topics in scheduling theory. Ann. Discret. Math 31, 1–60 (1987)
Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 21–169. Kluwer Academic, Dordrecht (1998)
Cheng, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel-machine scheduling research. Eur. J. Oper. Res. 47, 271–292 (1990)
Chiaselotti, G., Gualtieri, M.I., Pietramala, P.: Minimizing the makespan in nonpreemptive parallel machine scheduling problem. J. Math. Model. Algorithm. 9(1), 39–51 (2010)
Coffman, E.G. Jr, Garey, M.R., Johnson, D.S.: An application of bin-paking to multiprocessor scheduling. SIAM J. Comput 7, 1–17 (1978)
Dell’Amico, M., Martello, S.: Optimal scheduling of tasks on identical parallel processors. ORSA J. Comput 7, 191–200 (1995)
Dell’Amico, M., Iori, M., Martello, S., Monaci, M.: Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J. Comput 20, 333–344 (2008)
Fatemi Ghomi, S.M.T., Jolai Ghazvini, F.: A pairwise interchange algorithm for parallel machine scheduling. Prod. Plan. Control 9, 685–689 (1998)
Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT 19, 312–320 (1979)
França, P.M., Gendrau, M., Laporte, G., Müller, F.M.: A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21, 205–210 (1994)
Frangioni, A., Necciari, E., Scutellà, M.G.: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J. Comb. Optim. 8, 195–220 (2004)
Friesen, D.K.: Tighter bounds for the MultiFit processor scheduling algorithm. SIAM J. Comput 13, 170–181 (1984)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math 17, 416–429 (1969)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discret. Math 5, 287–326 (1979)
Gupta, J.N.D., Ruiz-Torres, A.J.: LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod. Plan. Control 12, 28–36 (2001)
Haouari, M., Gharbi, A., Jemmali, M.: Tight bounds for the identical parallel machine scheduling problem. Int. Trans. Oper. Res. 13, 529–548 (2006)
Hoogeveen, A., Lenstra, J.K., Van de Velde, S.L.: Sequencing and scheduling. In: Dell’Amico, M., Maffioli, F., Martello, S (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 181–197. Wiley, Chichester (1997)
Hübscher, R., Glover, F.: Applying tabu search with influential diversification to multiprocessor scheduling. Comput. Oper. Res 21, 877–884 (1994)
Kedia, S.K.: A job scheduling problem with parallel processors. Unpublished Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor (1971)
Langston, M.A.: Improved 0/1 interchange scheduling. BIT 22, 282–290 (1982)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Handbooks in Operations Research and Management Science 4, pp. 445-522. Elsevier (1993)
Lee, C.Y., Massey, J.D.: Multiprocessor scheduling: combining LPT and MULTIFIT. Discret. Appl. Math. 20, 233–242 (1988)
Mokotoff, E.: Parallel machine scheduling problem: A survey. Asia Pac. J. Oper. Res 18, 193–242 (2001)
Mokotoff, E.: An exact algorithm for the identical parallel machine scheduling problem. Eur. J. Oper. Res 152, 758–769 (2004)
Paletta, G., Pietramala, P.: A new approximation algorithm for the nonpreemptive scheduling of independent jobs on identical parallel processors. SIAM J. Discret. Math 21, 313–328 (2007)
Paletta, G., Vocaturo, F.: A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm. SIAM J. Discret. Math. 23, 2198–2203 (2010)
Paletta, G., Vocaturo, F.: A composite algorithm for multiprocessor scheduling. J. Heuristics 17, 281–301 (2011)
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2012)
Thesen, A.: Design and evaluation of tabu search algorithms for multiprocessor scheduling. J. Heuristics 141-160, 4 (1998)
Yue, M.: On the exact upper bound for the MultiFit processor scheduling algorithm. Ann. Oper. Res 24, 233–259 (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Paletta, G., Ruiz-Torres, A.J. Partial Solutions and MultiFit Algorithm for Multiprocessor Scheduling. J Math Model Algor 14, 125–143 (2015). https://doi.org/10.1007/s10852-014-9262-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-014-9262-z