Abstract
We consider the problem of scheduling a given set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a given release date and is compatible to only a subset of the machines. The machines are ordered and indexed in such a way that a higher-indexed machine can process all the jobs that a lower-indexed machine can process. We present a solution procedure to solve this problem in O(n 2+mnlogn) time. We also extend our results to the tree-hierarchical processing sets case and the uniform machine case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho AV, Hopcroft JE and Ullman JD (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley: Reading, MA.
Hwang H-C, Chang SY and Lee K (2004). Parallel machine scheduling under a grade of service provision. Computers & Operations Research 31 (12): 2055–2061.
Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: Algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Handbooks in Operations Research and Management Science, Logistics of Production and Inventory. Vol. 4 North-Holland: Amsterdam, pp 445–522.
Lee K, Leung JY-T and Pinedo ML (2011). Scheduling jobs with equal processing times subject to machine eligibility constraints. Journal of Scheduling 14 (1): 27–38.
Lee K, Leung JY-T and Pinedo ML (2013). Makespan minimization in online scheduling with machine eligibility. Annals of Operations Research 204: 189–222.
Leung JY-T and Li C-L (2008). Scheduling with processing set restrictions: A survey. International Journal of Production Economics 116 (2): 251–262.
Li C-L (2006). Scheduling unit-length jobs with machine eligibility restrictions. European Journal of Operational Research 174 (2): 1325–1328.
Li C-L and Wang X (2010). Scheduling parallel machines with inclusive processing set restrictions and job release times. European Journal of Operational Research 200 (3): 702–710.
Lim K (2010). Parallel machines scheduling with GoS eligibility constraints: A survey. Journal of the Korean Institute of Industrial Engineers 36 (4): 248–254.
Ou J, Leung JY-T and Li C-L (2008). Scheduling parallel machines with inclusive processing set restrictions. Naval Research Logistics 55 (4): 328–338.
Acknowledgements
This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5236/09E.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, CL., Li, Q. Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions. J Oper Res Soc 66, 516–523 (2015). https://doi.org/10.1057/jors.2014.22
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2014.22