Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 2111-2121

  Lee, Wen Chiung ^a   Wu, Chin Chia ^a   Chung, Yu Hsiang ^a   Liu, Han Chu ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Deteriorating jobs; Flow shop; Scheduling; Total completion time

Indexed keywords

CONTROL THEORY; MACHINE SHOP PRACTICE; SCHEDULING;

DETERIORATING JOBS; DETERIORATION RATES; DOMINANCE RULES; FLOW SHOP; LOWER BOUNDS; OPTIMAL SOLUTIONS; PERMUTATION FLOW SHOPS; SINGLE MACHINES; SPEED-UP; TOTAL COMPLETION TIME; TOTAL COMPLETION TIMES;

DETERIORATION;

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

References (25)

1. Gupta S.K., Kunnathur A.S., and Dandapani K. Optimal repayment policies for multiple loans. Omega 15 4 (1987) 323-330
2. Kunnathur A.S., and 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 1 (1990) 56-64
3. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Computers & Industrial Engineering 14 (1988) 387-393
4. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
5. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society 50 (1999) 711-720
6. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152 (2004) 1-13
7. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 1-3 (2002) 195-209
8. Wang J.B., Ng C.T.D., Cheng T.C.E., and Liu L.L. Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Applied Mathematics and Computation 180 (2006) 185-193
9. Wang J.B., and Xia Z.Q. Flow shop scheduling with deteriorating jobs under dominating machines. OMEGA-The International Journal of Management Science 34 (2006) 327-336
10. Wu C.C., and Lee W.C. Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. International Journal of Production Economics 103 (2006) 572-584
11. Baker K.R. Introduction to sequencing and scheduling (1974), Wiley, New York
12. Pinedo M. Scheduling: theory, algorithms and systems (2002), Prentice-Hall, Upper Saddle River, NJ
13. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
14. Chung C.S., Flynn J., and Kirca O. A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 79 (2002) 185-196
15. Bansal S.P. Minimizing the sum of completion times of n jobs over m machines in a flowshop-a branch and bound approach. AIIE Transactions 9 (1977) 306-311
16. Framinan J.M., Leisten R., and Gupta J.N.D. A review and classification heuristics for permutation flow shop scheduling with makespan objective. Journal of the Operational Research Society 55 (2004) 1243-1255
17. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimization in permutation flowshops. Computers & Operations Research 32 (2005) 1237-1254
18. Nawaz M., Enscore E.E., and Hamm I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA-The International Journal of Management Science 11 (1983) 91-95
19. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103 (1997) 129-138
20. Woo D.S., and Yim H.S. A heuristic algorithm for mean flowtime objective in scheduling. Computers & Operations Research 25 (1998) 175-182
21. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
22. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimization in permutation flow shops. OMEGA-The International Journal of Management Science 31 (2003) 311-317
23. Framinan J.M., Leisten R., and Rajendran C. Differential initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 41 (2003) 121-148
24. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77 (2002) 71-83
25. Rajendran C., and Chaudhuri D. Heuristic algorithms for continuous flowshop problem. Naval Research Logistics 37 (1990) 695-705