Parallel batch scheduling of equal-length jobs with release and due dates
- 224 Downloads
In this paper we study parallel batch scheduling problems with bounded batch capacity and equal-length jobs in a single and parallel machine environment. It is shown that the feasibility problem 1|p-batch,b<n,r j ,p j =p,C j ≤d j |− can be solved in O(n 2) time and that the problem of minimizing the maximum lateness can be solved in O(n 2log n) time. For the parallel machine problem P|p-batch,b<n,r j ,p j =p,C j ≤d j |− an O(n 3log n)-time algorithm is provided, which can also be used to solve the problem of minimizing the maximum lateness in O(n 3log 2 n) time.
KeywordsSingle machine scheduling Parallel machine scheduling Parallel batching Complexity
Unable to display preview. Download preview PDF.
- Brucker, P. (2007). Scheduling algorithms. Berlin: Springer. Google Scholar
- Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In Graves, S. C., Rinnooy Kan, A. H. G., & Zipkin, P. H. (Eds.) Handbooks in operations research and management science, logistics of production and inventory (Vol. 4, pp. 445–522). Amsterdam: North-Holland. CrossRefGoogle Scholar
- Simons, B. B. (1978). A fast algorithm for multiprocessor scheduling of unit-length jobs. In IEEE 19th annual symposium on foundations of computer science (pp. 246–252). Google Scholar