Abstract
The multiprocessor scheduling problem consists in scheduling a set of tasks with known processing times into a set of identical processors so as to minimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing problem. Computational results illustrating the effectiveness of this approach are reported and compared with those obtained by other heuristics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics (2004) (to appear)
Alvim, A.C.F.: Uma heurística híbrida de melhoria para o problema de bin packing e sua aplicação ao problema de escalonamento de tarefas, Doctorate thesis, Catholic University of Rio de Janeiro, Department of Computer Science, Rio de Janeiro (2003)
Błażewicz, J.: Selected topics in scheduling theory. In: Laporte, G., Martello, S., Minoux, M., Ribeiro, C.C. (eds.) Surveys in Combinatorial Optimization, pp. 1–60. North-Holland, Amsterdam (1987)
Bruno, J.L., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17, 382–387 (1974)
Cheng, T., Sin, C.: A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47, 271–292 (1990)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing 7, 1–17 (1978)
Dell’Amico, M., Martello, S.: Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing 7, 191–200 (1995)
Fatemi-Ghomi, S.M., Jolai-Ghazvini, F.: A pairwise interchange algorithm for parallel machine scheduling. Production Planning and 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., Gendreau, M., Laporte, G., Müller, F.M.: A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers Ops. Research 21, 205–210 (1994)
Frangioni, A., Scutellà, M.G., Necciari, E.: Multi-exchange algorithms for the minimum makespan machine scheduling problem, Report TR-99-22, Dipartimento di Informatica, Università di Pisa, Pisa (1999)
Frangioni, A., Necciari, E., Scutellà, M.G.: A multi-exchange neighborhood for minimum makespan machine scheduling problems. Journal of Combinatorial Optimization (to appear)
Friesen, D.K.: Tighter bounds for the MULTIFIT processor scheduling algorithm. SIAM Journal on Computing 13, 170–181 (1984)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 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. Annals of Discrete Mathematics 5, 287–326 (1979)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM 34, 144–162 (1987)
Hübscher, R., Glover, F.: Applying tabu search with influential diversification to multiprocessor scheduling. Computers and Operations Research 21, 877–884 (1994)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3, 299–325 (1974)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Zipkin, P.H., Rinnooy Kan, A.H.G. (eds.) Logistics of Production and Inventory: Handbooks in Operations Research and Management Science, pp. 445–522. North-Holland, Amsterdam (1993)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)
McNaughton: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959)
Necciari, E.: Istances of machine scheduling problems, Online document available at http://www.di.unipi.it/di/groups/optimize/Data/MS.html (last visited on November 21, 2001)
Scholl, A., Voss, S.: Simple assembly line balancing - Heuristic approaches. Journal of Heuristics 2, 217–244 (1996)
Yue, M.: On the exact upper bound for the MULTIFIT processor scheduling algorithm. Annals of Operations Research 24, 233–259 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvim, A.C.F., Ribeiro, C.C. (2004). A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive