Minimizing total completion time in a two-machine flow shop with deteriorating jobs

Applied Mathematics and Computation

Volumn 180, Issue 1, 2006, Pages 185-193

  Wang, Ji Bo ^a,b   Daniel Ng, C T ^b   Cheng, T C E ^b   Liu, Li Li ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Branch and bound algorithm; Flow shop; Scheduling; Simple linear deterioration; Total completion time

Indexed keywords

ALGORITHMS; FUNCTIONS; HEURISTIC METHODS; PROGRAM PROCESSORS;

BRANCH-AND-BOUND ALGORITHM; FLOW SHOP; SIMPLE LINEAR DETERIORATION; TOTAL COMPLETION TIME;

MACHINE SHOPS;

EID: 33748318134     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.11.162     Document Type: Article

References (24)

1. 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
2. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
3. Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-94
4. Cheng T.C.E., and Ding Q. The complexity of scheduling starting time dependent task with release dates. Information Processing Letters 65 (1998) 75-79
5. 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
6. 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
7. Croce F.D., Ghirardi M., and Tadei R. The two-machine total completion time flow shop problem. European Journal of Operational Research 90 (1996) 227-237
8. Croce F.D., Ghirardi M., and Tadei R. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research 139 (2002) 293-301
9. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
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. Hoogeveen H., and Kawaguchi T. Minimizing total completion time in a two-machine flowshop: analysis of special cases. Mathematics of Operations Research 24 (1999) 887-913
13. Ignall E., and Schrage L.E. Application of the branch and bound technique to some flowshop scheduling problems. Operations Research 13 (1965) 400-412
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. Pinedo M. Scheduling: Theory, Algorithms and Systems (1995), Prentice Hall, New Jersey
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., and Xia Z.-Q. Scheduling jobs under decreasing linear deterioration. Information Processing Letters 94 (2005) 63-69
23. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34 (2006) 327-336
24. Wang J.-B., and Xia Z.-Q. No-wait or no-idle permutation flowshop scheduling problem with dominating machines. Journal of Applied Mathematics and Computing 17 (2005) 419-432