Single machine scheduling with release dates and rejection

European Journal of Operational Research

Volumn 198, Issue 3, 2009, Pages 975-978

  Zhang, Liqi ^a   Lu, Lingfa ^a   Yuan, Jinjiang ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

Fully polynomial time approximation scheme; Rejection penalty; Scheduling

Indexed keywords

FULLY POLYNOMIAL-TIME APPROXIMATION SCHEME; MAKESPAN; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; REJECTION PENALTY; RELEASE DATES; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING;

APPROXIMATION ALGORITHMS; MACHINERY; SCHEDULING;

POLYNOMIAL APPROXIMATION;

EID: 64049119524     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.10.006     Document Type: Article

References (10)

1. Bartal Y., Leonardi S., Spaccamela A.M., Sgall J., and Stougie L. Multi-processor scheduling with rejection. SIAM Journal on Discrete Mathematics 13 (2000) 64-78
2. 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
3. Dosa G., and He Y. Scheduling with machine cost and rejection. Journal of Combinatorial Optimization 12 (2006) 337-350
4. 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
5. 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
6. Garey M.R., and Johnson D.S. Computers and Intractablity: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
7. Hoogeveen H., Skutella M., and Woeginger G.J. Preemptive scheduling with rejection. Mathematics Programming 94 (2003) 361-374
8. Lawler E.L. Optimal sequencing a single machine subject to precedence constraints. Management Science 19 (1973) 544-546
9. 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
10. Seiden S. Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science 262 (2001) 437-458