Skip to main content
SpringerLink
Log in

Scheduling jobs with equal processing times subject to machine eligibility constraints

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios.

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

Access this article

Log in via an institution

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

  • Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assignments. Journal of Algorithms, 18, 221–237.

    Article  Google Scholar 

  • Bar-Noy, A., Freund, A., & Naor, J. (2001). Online load balancing in a hierarchical server topology. SIAM Journal of Computing, 31, 527–549.

    Article  Google Scholar 

  • Brucker, P., Jurisch, B., & Kramer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research, 70, 57–73.

    Article  Google Scholar 

  • Brucker, P., & Kravchenko, S. A. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11, 229–237.

    Article  Google Scholar 

  • Centeno, G., & Armacost, R. L. (2004). Minimizing makespan on parallel machines with release time and machine eligibility restrictions. International Journal of Production Research, 42, 1243–1256.

    Article  Google Scholar 

  • Chen, B., Potts, C. N., & Woeginger, G. J. (1998). In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization : Vol. 3. A review of machine scheduling: complexity, algorithms and approximability (pp. 21–169). Boston: Kluwer Academic.

    Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1978). Strong NP-completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery, 25, 499–508.

    Google Scholar 

  • Glass, C. A., & Kellerer, H. (2007). Parallel machine scheduling with job assignment restrictions. Naval Research Logistics, 54, 250–257.

    Article  Google Scholar 

  • Glass, C. A., & Mills, H. R. (2006). Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers & Operations Research, 33, 620–638.

    Article  Google Scholar 

  • Hopcroft, J. E., & Karp, R. M. (1973). An O(n 5/2) algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2, 225–231.

    Article  Google Scholar 

  • Huo, Y., & Leung, J. Y.-T. (2010). Parallel machine scheduling with nested processing set restrictions. European Journal of Operational Research, 204, 229–236.

    Article  Google Scholar 

  • Hwang, H.-C., Chang, S. Y., & Lee, K. (2004). Parallel machine scheduling under a grade of service provision. Computers & Operations Research, 31, 2055–2061.

    Article  Google Scholar 

  • Kravchenko, S. A., & Werner, F. (2009). On a parallel machine scheduling problem with equal processing times. Discrete Applied Mathematics, 157, 848–852.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Leung, J. Y.-T., & Li, C.-L. (2008). Scheduling with processing set restrictions: a survey. International Journal of Production Economics, 116, 251–262.

    Google Scholar 

  • Lin, Y., & Li, W. (2004). Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research, 156, 261–266.

    Article  Google Scholar 

  • Li, C.-L. (2006). Scheduling unit-length jobs with machine eligibility restrictions. European Journal of Operational Research, 174, 1325–1328.

    Article  Google Scholar 

  • Ou, J., Leung, J. Y.-T., & Li, C.-L. (2008). Scheduling parallel machines with inclusive processing set restrictions. Naval Research Logistics, 55, 328–338.

    Article  Google Scholar 

  • Pinedo, M. L. (1995). Scheduling—theory, algorithms and systems. New York: Prentice Hall.

    Google Scholar 

  • Shchepin, E. V., & Vakhania, N. (2005). An optima rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters, 33, 127–133.

    Article  Google Scholar 

  • Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal of Computing, 12, 294–299.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY, 10012-1126, USA

    Kangbok Lee & Michael L. Pinedo

  2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Joseph Y.-T. Leung

Authors
  1. Kangbok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph Y.-T. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph Y.-T. Leung.

Additional information

K. Lee’s work supported by the Korea Research Foundation Grant KRF-2007-357-D00270.

J.Y.-T. Leung’s work supported in part by NSF Grant DMI-0556010.

M.L. Pinedo’s work supported in part by NSF Grant DMI-0555999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, K., Leung, J.YT. & Pinedo, M.L. Scheduling jobs with equal processing times subject to machine eligibility constraints. J Sched 14, 27–38 (2011). https://doi.org/10.1007/s10951-010-0190-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-010-0190-0

Keywords

Search

Navigation