On the complexity of bi-criteria scheduling on a single batch processing machine
- 93 Downloads
This paper considers hierarchical bi-criteria scheduling on a single batch processing machine where the primary criterion is the makespan. We show that the problem where the secondary criterion is the total completion time can be solved in polynomial time for a given machine capacity and the problem where the secondary criterion is the (weighted) number of late jobs is (strongly) NP-hard.
KeywordsScheduling Batch processing Bi-criteria Complexity
Unable to display preview. Download preview PDF.
- Cheng, T. C. E., Liu, Z. H., & Yu, W. C. (2001). Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Transactions, 33, 685–690. Google Scholar
- Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E., Miller, & J. W., Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum. Google Scholar
- Lee, C. Y., & Vairaktarakis, G. L. (1993). Complexity of single machine hierarchical scheduling: A survey. Complexity in Numerical Optimization, 19, 269–298. Google Scholar
- Perez, I. C., Fowler, J. W., & Carlyle, W. M. (2005). Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Computers and Operations Research, 32, 327–341. Google Scholar