The NP-hardness of minimizing the total late work on an unbounded batch machine

Asia-Pacific Journal of Operational Research

Volumn 26, Issue 3, 2009, Pages 351-363

  Ren, Jianfeng ^a   Zhang, Yuzhong ^a   Sun, Guo ^a  

^a QUFU NORMAL UNIVERSITY   (China)

Author keywords

Batching machine; Late work; NP hardness; Scheduling

Indexed keywords

BATCH MACHINES; BATCH PROCESSING MACHINE; BATCHING MACHINE; LARGEST PROCESSING TIME; LATE WORK; NP-HARD; NP-HARDNESS; PROCESSING TIME;

COMPUTATIONAL COMPLEXITY; SCHEDULING;

HARDNESS;

EID: 68949192371     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595909002249     Document Type: Article

References (18)

1. Afrati, F, E Bampis, C Chekuri and D Karger (1999). Approximation schemes for minimizing average weighted completion time with release dates. In Proceeding of the 40th Annual Symposium on Foundations of Computer Science, New York.
2. Brucker, P, A Gladky, H Hoogeveen, MY Kovalyov, CN Potts, T Tautenhahn and SL Van de Velde (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31-54.
3. Chandru, V, CY Lee and R Uzsoy (1993a). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61-65.
4. Chandru, V, CY Lee and R Uzsoy (1993b). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097-2121.
5. Cheng, TCE, ZH Liu and W Yu (2001). Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Transactions, 33, 685-690.
6. Deng, X and Y Zhang (1999). Minimizing mean response time in batch processing system. Lecture Notes in Computer Science, Springer-Verlag, 1627, 231-240.
7. Deng, X, CK Poon and Y Zhang (2003). Approximation algorithms in batch processing. Journal of Combinatorial Optimizations, 7, 247-257.
8. Graham, RL, EL Lawler, JK Lenstra and AHG Rinnooy Kan (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 31-54.
9. Kovalyov, MY and W Kubiak (1994). A fully polynomial time approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research, 19, 86-93.
10. Lee, CY and R Uzsoy (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219-236.
11. Lee, CY, R Uzsoy and LA Martin Vega (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764-775.
12. Liu, Z and W Yu (2000). Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105, 129-136.
13. Liu, ZH, JJ Yuan and TCE Cheng (2003). On scheduling an unbounded batch machine. Operations Research Letters, 31, 42-48.
14. Papadimitriou, CH and K Steiglitz (1982). Combinatorial optimization algorithms and complexity. Printice-Hall Inc.
15. Potts, CN and LN Van Wassenhove (1992a). Single machine scheduling to minimize total late work. Operations Research, 40, 586-595.
16. Potts, CN and LN Van Wassenhove (1992b). Approximation algorithms for scheduling a single machine to minimize total late work. Operations Research Letters, 11, 261-266.
17. j. Acta Math-maticae Applicate Sinica, 30, 46-52.
18. Zhang, Y and L Wang (2005). The NP-completeness of a new batch scheduling problem, Journal of System Science and Mathmatic Science, 25, 13-17.