Scheduling jobs with equal processing times subject to machine eligibility constraints
 Kangbok Lee,
 Joseph Y.T. Leung,
 Michael L. Pinedo
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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.
 Azar, Y., Naor, J., Rom, R. (1995) The competitiveness of online assignments. Journal of Algorithms 18: pp. 221237 CrossRef
 BarNoy, A., Freund, A., Naor, J. (2001) Online load balancing in a hierarchical server topology. SIAM Journal of Computing 31: pp. 527549 CrossRef
 Brucker, P., Jurisch, B., Kramer, A. (1997) Complexity of scheduling problems with multipurpose machines. Annals of Operations Research 70: pp. 5773 CrossRef
 Brucker, P., Kravchenko, S. A. (2008) Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling 11: pp. 229237 CrossRef
 Centeno, G., Armacost, R. L. (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. International Journal of Production Research 42: pp. 12431256 CrossRef
 Chen, B., Potts, C. N., Woeginger, G. J. In: Du, D.Z., Pardalos, P. M. eds. (1998) A review of machine scheduling: complexity, algorithms and approximability. Kluwer Academic, Boston, pp. 21169
 Garey, M. R., Johnson, D. S. (1978) Strong NPcompleteness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery 25: pp. 499508
 Glass, C. A., Kellerer, H. (2007) Parallel machine scheduling with job assignment restrictions. Naval Research Logistics 54: pp. 250257 CrossRef
 Glass, C. A., Mills, H. R. (2006) Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers & Operations Research 33: pp. 620638 CrossRef
 Hopcroft, J. E., Karp, R. M. (1973) An O(n 5/2) algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing 2: pp. 225231 CrossRef
 Huo, Y., Leung, J. Y.T. (2010) Parallel machine scheduling with nested processing set restrictions. European Journal of Operational Research 204: pp. 229236 CrossRef
 Hwang, H.C., Chang, S. Y., Lee, K. (2004) Parallel machine scheduling under a grade of service provision. Computers & Operations Research 31: pp. 20552061 CrossRef
 Kravchenko, S. A., Werner, F. (2009) On a parallel machine scheduling problem with equal processing times. Discrete Applied Mathematics 157: pp. 848852 CrossRef
 Lenstra, J. K., Shmoys, D. B., Tardos, E. (1990) Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46: pp. 259271 CrossRef
 Leung, J. Y.T., Li, C.L. (2008) Scheduling with processing set restrictions: a survey. International Journal of Production Economics 116: pp. 251262
 Lin, Y., Li, W. (2004) Parallel machine scheduling of machinedependent jobs with unitlength. European Journal of Operational Research 156: pp. 261266 CrossRef
 Li, C.L. (2006) Scheduling unitlength jobs with machine eligibility restrictions. European Journal of Operational Research 174: pp. 13251328 CrossRef
 Ou, J., Leung, J. Y.T., Li, C.L. (2008) Scheduling parallel machines with inclusive processing set restrictions. Naval Research Logistics 55: pp. 328338 CrossRef
 Pinedo, M. L. (1995) Scheduling—theory, algorithms and systems. Prentice Hall, New York
 Shchepin, E. V., Vakhania, N. (2005) An optima rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters 33: pp. 127133 CrossRef
 Simons, B. (1983) Multiprocessor scheduling of unittime jobs with arbitrary release times and deadlines. SIAM Journal of Computing 12: pp. 294299 CrossRef
 Title
 Scheduling jobs with equal processing times subject to machine eligibility constraints
 Journal

Journal of Scheduling
Volume 14, Issue 1 , pp 2738
 Cover Date
 20110201
 DOI
 10.1007/s1095101001900
 Print ISSN
 10946136
 Online ISSN
 10991425
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Parallel machine scheduling
 Eligibility constraint
 Nested and inclusive eligible sets
 Equalprocessingtime jobs
 Online and offline scheduling
 Makespan
 Competitive ratio
 Worstcase ratio
 Industry Sectors
 Authors

 Kangbok Lee ^{(1)}
 Joseph Y.T. Leung ^{(2)}
 Michael L. Pinedo ^{(1)}
 Author Affiliations

 1. Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY, 100121126, USA
 2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, 07102, USA