Bounded single-machine parallel-batch scheduling with release dates and rejection

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2748-2751

  Lu, Lingfa ^a   Cheng, T C E ^b   Yuan, Jinjiang ^a   Zhang, Liqi ^a  

^a ZHENGZHOU UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Parallel batch; Polynomial time approximation scheme; Rejection penalty; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; SCHEDULING;

BATCH-SCHEDULING; MAKESPAN; PARALLEL-BATCH; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME APPROXIMATION SCHEME; REJECTION PENALTY; RELEASE DATES; SINGLE MACHINES;

POLYNOMIAL APPROXIMATION;

EID: 62549141448     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.12.003     Document Type: Article

References (12)

1. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., and van de Velde S.L. Scheduling a batching machine. Journal of Scheduling 1 (1998) 31-54
2. Lee C.-Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 (1999) 219-236
3. Liu Z.H., and Yu W.C. Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics 105 (2000) 129-136
4. Bartal Y., Leonardi S., Spaccamela A.M., Sgall J., and Stougie L. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics 13 (2000) 64-78
5. Seiden S. Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science 262 (2001) 437-458
6. Hoogeveen H., Skutella M., and Woeginger G.J. Preemptive scheduling with rejection. Mathematical Programming 94 (2003) 361-374
7. Dosa G., and He Y. Scheduling with machine cost and rejection. Journal of Combinatorial Optimization 12 (2006) 337-350
8. Cheng Y.S., and Sun S.J. Scheduling linear deteriorating jobs with rejection on a single machine. European Journal of Operational Research 194 (2009) 18-27
9. Zhang LQ, Lu LF, Yuan JJ. Single machine scheduling with release dates and rejection. European Journal of Operational Research 2008, doi:10.1016/j.ejor.2008.10.006.
10. Engels D.W., Karger D.R., Kolliopoulos S.G., Sengupta S., Uma R.N., and Wein J. Techniques for scheduling with rejection. Journal of Algorithms 49 (2003) 175-191
11. Epstein L., Noga J., and Woeginger G.J. On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters 30 (2002) 415-420
12. Lu L.F., Zhang L.Q., and Yuan J.J. The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science 396 (2008) 283-289