Skip to main content
SpringerLink
Log in

On the complexity of bi-criteria scheduling on a single batch processing machine

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Article  Google Scholar 

  • Chandru, V., Lee, C. Y., & Uzsoy, R. (1993). Minimizing total completion time on batch processing machine. International Journal of Production Research, 31, 2097–2122.

    Article  Google Scholar 

  • Chen, C. L., & Bulfin, R. L. (1993). Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research, 70, 115–125.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  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., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219–236.

    Article  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 

  • Liu, Z. H., Yuan, J. J., & Cheng, T. C. E. (2003). On scheduling an unbounded batch machine. Operations Research Letters, 31, 42–48.

    Article  Google Scholar 

  • Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165–178.

    Article  Google Scholar 

  • Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102–109.

    Article  Google Scholar 

  • Nagar, A., Haddock, J., & Heragu, S. (1995). Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research, 81, 88–104.

    Article  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 

  • Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59–66.

    Article  Google Scholar 

  • Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33, 2685–2708.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Shanghai Second Polytechnic University, No. 2360 Jinhai Road, Pudong, Shanghai, 201209, China

    L. L. Liu

  2. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    C. T. Ng & T. C. E. Cheng

Authors
  1. L. L. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. T. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. C. E. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. T. Ng.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-010-0180-2

Keywords

Search

Navigation