Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Computers and Operations Research

Volumn 32, Issue 3, 2005, Pages 521-536

  Jeng, A A K ^a   Lin, B M T ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Branch and bound algorithm; Single machine scheduling; Step deterioration; Total completion time

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DIFFERENTIAL EQUATIONS; FUNCTIONS; MACHINERY; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; SCHEDULING;

BRANCH-AND-BOUND ALGORITHMS; SINGLE-MACHINE SCHEDULING; STEP DETERIORATION; TOTAL COMPLETION TIME;

PROBLEM SOLVING;

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

References (16)

1. Cheng T.C.E., Ding Q. Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research. 134:2001;623-630.
2. Graham R.L., Lawler E.L., Lenstra J.K., Rinooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Annals of Discrete Mathematics. 5:1976;287-326.
3. Gupta S.K., Kunnathur A.S., Dandapai K. Optimal repayment policies for multiple loans. Omega. 15:1987;323-330.
4. Tanaev V.S., Gordon V.S., Shafransky Y.M. Schedule theory, single-stage systems. 1994;Kluwer, Dordrecht, Germany.
5. Gupta J.N.D., Gupta S.K. Single facility scheduling with nonlinear processing time. Computers and Industrial Engineering. 14:1988;387-393.
6. Chen Z.L. A note on single-processor scheduling with time-dependent execution times. Operations Research Letters. 17:1995;127-129.
7. Cheng T.C.E., Ding Q. Single machine scheduling with deadlines and increasing rate of processing times. Acta Informatica. 36:2000;673-692.
8. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research. 21:1994;653-659.
9. Kunnathur A.S., Gupta S.K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research. 47:1990;56-64.
10. Kubiak W., van de Velde S.L. Scheduling deteriorating jobs to minimize makespan. Naval Research Logistics. 45:1998;511-523.
11. Mosheiov G. Scheduling jobs with step-deterioration; minimizing makespan on a single and multi-machine. Computers and Industrial Engineering. 28:1995;869-879.
12. Sundararaghavan P.S., Kunnathur A.S. Single machine scheduling with start time dependent processing times. some solvable cases European Journal of Operational Research. 79:1994;394-403.
13. Jeng AAK, Lin BMT. Makespan minimization in single-machine scheduling with step-deterioration of processing times. Journal of the Operational Research Society 2002, manuscript submitted for publication.
14. Garey M.R., Johnson D.S. Computers and Intractability: a guide to the theory of NP-completeness. 1979;Freeman, New York.
15. Alidaee B., Womer N.K. Scheduling with time dependent processing times. review and extensions Journal of the Operational Research Society. 50:1999;711-720.
16. Cheng T.C.E., Ding Q., Lin B.M.T. A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research. 152:2003;1-13.