Abstract
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.
Similar content being viewed by others
References
Brucker, P., Gladky, A., Hoogevreen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & Van de Velde, S. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31–54.
Chandru, V., Lee, C. Y., & Uzsoy, R. (1993). Minimizing total completion time on batch processing machine. International Journal of Production Research, 31, 2097–2122.
Chen, C. L., & Bulfin, R. L. (1993). Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research, 70, 115–125.
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.
Jolai, F. (2005). Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research, 162, 184–190.
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.
Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219–236.
Lee, C. Y., & Vairaktarakis, G. L. (1993). Complexity of single machine hierarchical scheduling: A survey. Complexity in Numerical Optimization, 19, 269–298.
Liu, Z. H., Yuan, J. J., & Cheng, T. C. E. (2003). On scheduling an unbounded batch machine. Operations Research Letters, 31, 42–48.
Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165–178.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102–109.
Nagar, A., Haddock, J., & Heragu, S. (1995). Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research, 81, 88–104.
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.
Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59–66.
Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33, 2685–2708.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, L.L., Ng, C.T. & Cheng, T.C.E. On the complexity of bi-criteria scheduling on a single batch processing machine. J Sched 13, 629–638 (2010). https://doi.org/10.1007/s10951-010-0180-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0180-2