Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning

International Journal of Advanced Manufacturing Technology

Volumn 41, Issue 11-12, 2009, Pages 1221-1226

  Wang, Ji Bo ^a   Jiang, Yong ^a   Wang, Gang ^b,c  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^c SHENYANG NORMAL UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Learning effect; Scheduling; Setup times; Single machine

Indexed keywords

DETERIORATION; MACHINERY; POLYNOMIAL APPROXIMATION; SCHEDULING;

DETERIORATING JOBS; JOB COMPLETIONS; LEARNING EFFECT; MAKESPAN; MAKESPAN MINIMIZATIONS; MAXIMUM LATENESS; MINIMIZATION PROBLEMS; NUMBER OF TARDY JOBS; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME; PROCESSING TIME; SEQUENCE DEPENDENTS; SEQUENCE-DEPENDENT SETUP TIME; SETUP TIMES; SINGLE MACHINE; SINGLE-MACHINE SCHEDULING; TOTAL COMPLETION TIME; TOTAL WEIGHTED COMPLETION TIME;

OPTIMIZATION;

EID: 63449134462     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1512-7     Document Type: Article

References (17)

1. A Allahverdi JND Gupta T Aldowaisan 1999 A review of scheduling research involving setup considerations Omega 27 219 239
2. A Allahverdi CT Ng TCE Cheng MY Kovalyov 200 A survey of scheduling problems with setup times or costs Eur J Oper Res 187 985 1032
3. C Koulamas GJ Kyparisis 2008 Single-machine scheduling problems with past-sequence-dependent setup times Eur J Oper Res 187 68 72
4. W-H Kuo D-L Yang 2007 Single-machine scheduling with past-sequence- dependent setup and learning effects Inf Process Lett 102 22 26
5. B Alidaee NK Womer 1999 Scheduling with time-dependent processing times: review and extensions J Oper Res Soc 50 711 720
6. TCE Cheng Q Ding BMT Lin 2004 A concise survey of scheduling with time-dependent processing times Eur J Oper Res 152 1 13
7. D Biskup 2008 A state-of-the-art review on scheduling with learning effects Eur J Oper Res 188 315 329
8. C-C Wu W-C Lee Y-R Shiau 2007 Minimizing the total weighted completion time on a single machine under linear deterioration Int J Adv Manuf Technol 33 1237 1243
9. Y-R Shiau W-C Lee C-C Wu C-M Chang 2007 Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration Int J Adv Manuf Technol 34 774 782
10. Wang J-B, Lin L, Shan F (2007) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol DOI 10.1007/s00170-007-1255-x
11. Toksar MD, Guner E (2007) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol DOI 10.1007/s00170-007- 1128-3
12. Eren T, Guner E (2008) A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol DOI 10.1007/s00170-008-1436-2
13. J-B Wang TCE Cheng 2007 Scheduling problems with the effects of deterioration and learning Asia-Pac J Oper Res 24 2 245 261
14. RL Graham EL Lawler JK Lenstra AHG Rinnooy Kan 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Ann Discrete Math 5 287 326
15. W Townsend 1978 The single-machine problem with quadratic penalty function of completion times: a branch-and-bound solution Manage Sci 24 530 534
16. J Moore 1968 An n job, one machine sequencing algorithm for minimizing the number of late jobs Manage Sci 15 102 109
17. Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice Hall, New Jersey