On several scheduling problems with rejection or discretely compressible processing times

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3959 LNCS, Issue , 2006, Pages 90-98

  Cao, Zhigang ^a   Wang, Zhen ^a   Zhang, Yuzhong ^a   Liu, Shoupeng ^b  

^a QUFU NORMAL UNIVERSITY   (China)

^b BINZHOU MEDICAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMPRESSION; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

COMPRESSIBLE PROCESSING TIMES; COMPRESSION COST; PSEUDO-POLYNOMIAL TIME ALGORITHMS; SCHEDULING PROBLEMS;

SCHEDULING;

EID: 33745834031     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_8     Document Type: Conference Paper

References (16)

1. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall and L. Stougie: Multi-processor scheduling with rejection. SIAM Journal of Discrete Maths, 13, 2000, 64-78.
2. Z. Chen, Q. Lu and G. Tang: Single machine scheduling with discretely controllable processing times. Operations Research Letters, 21, 1997, 69-76.
3. B. Chen, C.N. Potts and G.J. Woeginger: A review of machine scheduling: complexity, algorithmthms and approximability. Handbook of Combinatorial Optimization, 3, edited by D.Z. Du and P.M. Pardalos, 21-169, 1998, Kluwer Academic Publishers.
4. R.L. Daniels, J.B. Mazzola: Flow shop scheduling with resource flexibility. Operations Research, 42, 1994, 504-522.
5. D.W. Engels, D.R. Karger, S.G. Kolliopoulos, S. Sengupta, R.N. Uma and J. Wein: Techniques for scheduling with rejection. Lecture Notes in Computer Science, 1461, 1998, 490-501.
6. L. Epstein, J. Noga and G. J. Woeginger: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters, 30, 2002, 415-420.
7. R.L. Graham, E.L.Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5, 287-326, 1979.
8. Y. He and X. Min: On-line uniform machine scheduling with rejection. Computing, 65, 2000, 1-12.
9. H. Hoogeveen, M. Skutella and G.J. Woeginger: Preemptive Scheduling with rejection. Mathematical Programming, Serial B94, 2003, 361-374.
10. H. Hoogeveen and G.J. Woeginger: Some comments on sequencing with controllable processing times. Computing, 68, 2002, 181-192.
11. R.M. Karp: Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher(eds.) Complexities of Computer Computations, Plenum Press, New York, 1972, 85-103.
12. S.S. Seiden: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science, 2621, 2001, 437-458.
13. S. Sengupta: Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection. Lecture Notes in Computer Science, 2748, 2003, 79-90.
14. R.G. Vickson: Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12, 1980, 258-262.
15. R.G. Vickson: Choosing the job sequence and processing times to minimize the total processing plus flow cost on a single machine. Operations Research, 28, 1980, 1155-1167.
16. G. Wan, B.P.-C. Yen and C.-L. Li: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard, Information Processing Letters, 79(6), 2001, 273-280.