Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs

Journal of the Operational Research Society

Volumn 60, Issue 12, 2009, Pages 1759-1766

  He, C C ^a   Wu, C C ^a   Lee, W C ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Scheduling; Single machine; Step deteriorating jobs; Total completion time

Indexed keywords

DETERIORATION; HEURISTIC ALGORITHMS; JOB SHOP SCHEDULING; LEARNING ALGORITHMS; OPTIMAL SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL RESULTS; DETERIORATING JOBS; DOMINANCE PROPERTIES; MAINTENANCE PROCEDURES; NEAR-OPTIMAL SOLUTIONS; SINGLE- MACHINES; TOTAL COMPLETION TIME;

BRANCH AND BOUND METHOD;

EID: 70350330520     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2008.123     Document Type: Article

References (20)

1. Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: Review and extensions. J Opl Res Soc 50: 711-720.
2. Bachman A and Janiak A (2000). Minimizing maximum lateness under linear deterioration. Eur J Opl Res 126: 557-566.
3. Bachman A, Janiak A and Kovalyov MY (2002). Minimizing the total weighted completion time of deteriorating jobs. Inform Process Lett 81: 81-84. (Pubitemid 33050952)
4. Browne S and Yechiali U (1990). Scheduling deteriorating jobs on a single processor. Opns Res 38: 495-498.
5. Cheng TCE and Ding Q (1998). The complexity of single machine scheduling with release times. Inform Process Lett 65: 75-79.
6. Cheng TCE and Ding Q (2001). Single machine scheduling with step-deteriorating processing times. Eur J Opl Res 134: 623-630.
7. Cheng TCE and Ding Q (2003). Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine. Comput Opns Res 30: 51-62.
8. Cheng TCE, Ding Q, Kovalyov MY, Bachman A and Janiak A (2003). Scheduling jobs with piecewise linear decreasing processing times. Nav Res Logist 50: 531-554.
9. Cheng TCE, Ding Q and Lin BMT (2004). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1-13.
10. French S (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood Ltd.: Chichester, UK.
11. Guo AX and Wang JB (2005). Single machine scheduling with deteriorating jobs under the group technology assumption. Int J Pure Appl Math 18: 225-231.
12. Gupta JND and Gupta SK (1988). Single facility scheduling with nonlinear processing times. Comput Ind Eng 14: 387-393.
13. Gupta SK, Kunnathur AS and Dandapani K (1987). Optimal repayment policies for multiple loans. Omega 15: 323-330.
14. Kunnathur AS and Gupta SK (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Opl Res 47: 56-64.
15. Mosheiov G (1994). Scheduling jobs under simple linear deterioration. Comput Opns Res 21: 653-659.
16. Mosheiov G (1995). Scheduling jobs with step-deterioration: Minimizing makespan on a single and multi-machine. Comput Ind Eng 28: 869-879.
17. Ng CT, Cheng TCE, Bachman A and Janiak A (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Inform Process Lett 81: 327-333. (Pubitemid 34078195)
18. Sundararaghavan PS and Kunnathur A (1994). Single machine scheduling with start time dependent processing time: Some solvable cases. Eur J Opl Res 78: 394-403.
19. Wang JB and Xia ZQ (2006). Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34: 327-336.
20. Wang JB, Ng CT, Cheng TCE and Liu LL (2006). Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180: 185-193.