Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration

Applied Mathematical Modelling

Volumn 33, Issue 2, 2009, Pages 1187-1199

  Tang, Lixin ^a   Liu, Peng ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Batching machine; Deterioration; Flowshop scheduling; Heuristic; Transportation

Indexed keywords

BOOLEAN FUNCTIONS; DETERIORATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; PORTALS; SCHEDULING;

BATCHING MACHINE; BATCHING MACHINES; COMPUTATIONAL EXPERIMENTS; DETERIORATING JOBS; FLOW-SHOP; FLOWSHOP SCHEDULING; HEURISTIC; MAKESPAN; MAXIMUM LATENESSES; MIXED INTEGER PROGRAMMING MODELS; NP-HARD; NUMERICAL RESULTS; OPTIMAL ALGORITHMS; POLYNOMIAL TIMES; SCHEDULING PROBLEMS; SINGLE-MACHINE; TOTAL COMPLETION TIMES; WORST CASES;

PROBLEM SOLVING;

EID: 54049088245     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2008.01.013     Document Type: Article

References (19)

1. Webster S., and Baker K.R. Scheduling groups of jobs on a single machine. Oper. Res. 43 (1995) 692-703
2. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. Euro. J. Oper. Res. 120 (2000) 228-249
3. Ahmadi J.H., Ahmadi R.H., Dasu S., and Tang C.S. Batching and scheduling jobs on batch and discrete processors. Oper. Res. 39 (1992) 750-763
4. Sung C.S., and Kim Y.H. Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Comput. Oper. Res. 29 (2002) 275-294
5. Lee C.Y., and Chen Z.L. Machine scheduling with transportation considerations. J. Schedul. 4 (2001) 3-24
6. Hurink J., and Knust S. Makespan minimization for flowshop problems with transportation times and a single robot. Discr. Appl. Mathem. 112 (2001) 199-216
7. Soukhal A., Oulamara A., and Martineau P. Complexity of flowshop scheduling problems with transportation constraints. Euro. J. Oper. Res. 161 (2005) 32-41
8. Li C.L., Vairaktarakis G., and Lee C.Y. Machine scheduling with deliveries to multiple customer locations. Euro. J. Oper. Res. 164 (2005) 39-51
9. Li C.L., and Ou J.W. Machine scheduling with pickup and delivery. Naval Res. Logist. 52 (2005) 1-14
10. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50 (1999) 711-720
11. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. Euro. J. Oper. Res. 152 (2004) 1-13
12. Mosheiov G. Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21 (1994) 653-659
13. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discr. Appl. Mathem. 117 (2002) 195-209
14. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quarter. 1 (1954) 61-68
15. Zhao C.L., Zhang Q.L., and Tang H.Y. Scheduling problems under linear deterioration. Acta Automat. Sin. 29 (2003) 531-535
16. Eren T., and Guner E. Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Mathem. Model. 31 (2007) 1351-1361
17. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann. Discr. Mathem. 5 (1979) 287-326
18. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman, New York
19. Ikura Y., and Gimple M. Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5 (1986) 61-65