Two-machine flow shop scheduling with linear decreasing job deterioration

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1487-1493

  Wang, Ji Bo ^a   Liu, Li Li ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b SHANGHAI SECOND POLYTECHNIC UNIVERSITY   (China)

Author keywords

Branch and bound algorithm; Deteriorating jobs; Flow shop; Heuristic algorithm; Scheduling; Total completion time

Indexed keywords

BRANCH-AND-BOUND ALGORITHM; COMPUTATIONAL RESULTS; DECREASING FUNCTIONS; DETERIORATING JOBS; DOMINANCE PROPERTIES; ELIMINATION PROCESS; FLOW SHOP; FLOW-SHOP SCHEDULING; FLOW-SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; PROBLEM INSTANCES; PROCESSING TIME; SPEED-UP; TOTAL COMPLETION TIME;

CONTROL THEORY; DETERIORATION; HEURISTIC METHODS; MACHINE SHOP PRACTICE; OPTIMAL SYSTEMS; PORTALS; SCHEDULING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 67349097752     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.09.020     Document Type: Article

References (26)

1. Alidaee B., and Womer N.K. Scheduling with time dependent processing processing times: review and extensions. Journal of the Operational Research Society 50 (1999) 711-720
2. Bachman A., Cheng T.C.E., Janiak A., and Ng C.T. Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society 53 (2002) 688-693
3. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
4. Brucker P. Scheduling algorithms (2004), Springer, Berlin
5. Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-94
6. Cheng T.C.E., and Ding Q. Single machine scheduling with step-deterioration processing times. European Journal of Operational Research 134 (2001) 623-630
7. 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
8. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
9. Hardy G.H., Littlewood J.E., and Polya G. Inequalities (1934), Cambridge University Press, Cambridge p. 261
10. Ho J.C., and Gupta J.N.D. Flowshop scheduling with dominant machines. Computers and Operations Research 22 (1995) 237-246
11. Ho K.I.-J., Leung J.Y.-T., and Wei W.-D. Complexity of scheduling tasks with time-dependent execution times. Information Processing Letters 48 (1993) 315-320
12. Hsieh Y.C., and Bricker D.L. Scheduling linearly deteriorating jobs on multiple machines. Computers and Industrial Engineering 32 (1997) 727-734
13. Kononov A., and Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines. Journal of the Operational Research Society 52 (2001) 708-717
14. Lee W.-C., and Wu C.-C. Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics 88 (2004) 85-93
15. Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Operations Research 39 (1991) 979-991
16. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
17. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
18. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 (2002) 195-209
19. Ng C.T., Cheng T.C.E., Bachman A., and Janiak A. Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters 81 (2002) 327-333
20. Sundararaghavan P.S., and Kunnathur A.S. Single machine scheduling with start time dependent processing times: Some solvable cases. European Journal of Operational Research 78 (1994) 394-403
21. i scheduling problems. International Journal of Production Economics 44 (1996) 225-237
22. Wang J.-B. Flow shop scheduling problems with decreasing linear deterioration under dominant machines. Computers and Operations Research 34 (2007) 2043-2058
23. Wang J.-B., Ng C.T., 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
24. Wang J.-B., and Xia Z.-Q. Scheduling jobs under decreasing linear deterioration. Information Processing Letters 94 (2005) 63-69
25. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34 (2006) 327-336
26. Wang J.-B., and Xia Z.-Q. Flow shop scheduling problems with deteriorating jobs under dominating machines. Journal of the Operational Research Society 57 (2006) 220-226