Skip to main content
Log in

Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The classical deterministic scheduling problem of minimizing the makespan on unrelated parallel processors is known to be NP-hard in the strong sense. Given the mixed integer linear model with binary decision variables, this paper presents heuristic algorithms based on partial enumeration. Basically, they consist in the construction of mixed integer subproblems, considering the integrality of some subset of variables, formulated using the information obtained from the solution of the linear relaxed problem. Computational experiments are reported for a collection of test problems, showing that some of the proposed algorithms achieve better solutions than other relevant approximation algorithms published up to now.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.G. Coffman, Jr., M.R. Garey and D.S. Johnson, An application of Bin-Packing to multiprocessor scheduling, SIAM Journal on Computing 7 (1978) 1–17.

    Google Scholar 

  2. E. Davis and J.M. Jaffe, Algorithms for scheduling tasks on unrelated parallel processors, Journal of the ACM 28 (1981) 721–736.

    Google Scholar 

  3. C. Dillenberger, L. Escudero, A. Wollensak and W. Zhang, On practical resource allocation for productionplanning and scheduling with period overlapping setups, European Journal of Operational Research 75 (1994) 275–286.

    Google Scholar 

  4. D.K. Friesen and M.A. Langston, Bounds forMultiFit scheduling on uniform processors, SIAM Journal of Computing 12 (1983) 60–70.

    Google Scholar 

  5. C.A. Glass, C.N. Potts and P. Shade, Unrelated parallel machine scheduling using local search, Mathematical and Computational Modelling 20 (1994) 41–52.

    Google Scholar 

  6. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics 5 (1979) 287–326.

    Google Scholar 

  7. A.M.A. Hariri and C.N. Potts, Heuristics for scheduling unrelated parallel processor, Computers and Operations Research 3 (1991) 323–331.

    Google Scholar 

  8. E. Horowitz and S. Sahni, Exact and approximate algorithms for scheduling non-identical processors, Journal of the ACM 2 (1976) 317–327.

    Google Scholar 

  9. O.H. Ibarra and C.E. Kim, Heuristic algorithms for scheduling independent tasks on non-identical processors, Journal of the ACM 24 (1977) 280–289.

    Google Scholar 

  10. E.L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, Journal of the ACM 25 (1978) 612–619.

    Google Scholar 

  11. J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization, in: Interfaces Between Computer Science and Operations Research, Proceedings of a Symposium, eds. J.K. Lenstra, A.H.G. Rinnooy Kan and P. Van Emde Boas, Matematisch Centrum, Amsterdam, (1979) pp. 64–85.

    Google Scholar 

  12. J.K. Lenstra, D.B. Shmoys and E. Tardos, Approximation algorithms for scheduling unrelated parallel processors, Mathematical Programming 46 (1990) 259–271.

    Google Scholar 

  13. R. Mansini and M.G. Speranza, Heuristic algorithms for the portfolio selection problem with minimum transaction lots, European Journal of Operational Research 114 (1999) 219–233.

    Google Scholar 

  14. S. Martello, F. Soumis and P. Toth, Exact approximation algorithm for makespan minimization on unrelated parallel processors, Discrete Applied Mathematics 75 (1997) 169–188.

    Google Scholar 

  15. E. Mokotoff, Parallel machines scheduling: A survey, Asia Pacific Journal on Operational Research 18 (2001) 193–242.

    Google Scholar 

  16. E. Mokotoff and P. Chrétienne, A cutting plane algorithm for the unrelated parallel machine scheduling problem, European Journal of Operational Research 141 (2002) 517–527.

    Google Scholar 

  17. N. Piersma and W. van Dijk, A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search, Mathematical and Computational Modelling 24 (1996) 11–19.

    Google Scholar 

  18. J. Plans and A. Corominas, Modelos de PLM para problemas de líneas de montaje y resolución mediante fix and relax, in: XXIV Congreso Nacional de Estadística e Investigación Operativa, Almería, (1998) pp. 625–627.

  19. C.N. Potts, Analysis of a linear programming heuristic for scheduling unrelated parallel processors, Discrete Applied Mathematics 10 (1985) 155–164.

    Google Scholar 

  20. F. Sourd, Scheduling tasks on unrelated machines: large neighborhood improvement procedures, Journal of Heuristics 7 (2001) 515–531.

    Google Scholar 

  21. B. Srivastava, An effective heuristic for minimising makespan on unrelated parallel machines, Journal of the Operational Research Society 49 (1998) 886–894.

    Google Scholar 

  22. H.I. Stern, Minimizing makespan for independent jobs on nonidentical parallel processor - an optimal procedure, Working Paper 2/75, Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva (1976).

    Google Scholar 

  23. S.L. Van de Velde, Duality-based algorithms for scheduling unrelated parallel machines, ORSA Journal on Computing 5 (1993) 192–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mokotoff, E., Jimeno, J. Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem. Annals of Operations Research 117, 133–150 (2002). https://doi.org/10.1023/A:1021569406280

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021569406280

Navigation