Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines

European Journal of Operational Research

Volumn 183, Issue 1, 2007, Pages 115-124

  Cheng, MingBao ^a   Sun, ShiJie ^b   He, LongMin ^b  

^a JINAN UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Algorithm; Deteriorating jobs; Dominant machines; Permutation flow shop; Scheduling

Indexed keywords

CONSTRAINT THEORY; POLYNOMIALS; SCHEDULING ALGORITHMS;

DETERIORATING JOBS; DOMINANT MACHINES; PERMUTATION FLOW; PERMUTATION FLOW SHOP;

OPERATIONS RESEARCH;

EID: 34249042307     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.10.043     Document Type: Article

References (18)

1. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14 (1988) 387-393
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. Eur. J. Oper. Res. 47 (1990) 56-64
3. Sundararaghavan P.K., and Kunnathur A.S. Single machine scheduling with start time-dependent processing times: Some solvable cases. Eur. J. Oper. Res. 78 (1994) 394-403
4. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: Review and extensions. J. Opl. Res. Sco. 50 (1999) 711-720
5. Mosheiov G. Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21 (1994) 653-659
6. Ho K.I.-L., Leung J.Y.-T., and Wei W.-D. Complexity of scheduling tasks with time-dependent execution times. Inform. Process Lett. 48 (1996) 315-320
7. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152 (2004) 1-13
8. Melnikov O.L., and Shafransky Y.M. Parametric problem of scheduling theory. Kibernetika 6 (1979) 53-57
9. Kononov A. Combinatorial complexity of scheduling jobs with simple linear deterioration. Discr. Anal. Oper. Res. 3 (1996) 15-32
10. Kononov A., and Gamiejnowicz N.P. Hard cases in scheduling deteriorating jobs on dedicated machines. J. Opl. Res. Sco. 52 (2001) 708-717
11. Moshieov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Eur. J. Oper. Res. 117 (2002) 195-209
12. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for m job m machine sequencing problem. Manage. Sci. 16 (1970) 630-637
13. Dannenbring D.G. An evaluation of flow shop sequencing heuristics. Manage. Sci. 23 (1977) 1174-1182
14. Gonzalez T., and Sahni S. Flow shop and job-shop schedules: Complexity and approximation. Oper. Res. 26 (1978) 36-52
15. Smutnicki C. Some results of worst-case analysis for flow shop scheduling. Eur. J. Oper. Res. 109 (1998) 66-87
16. Nouweland A.V.D., Krabbenborg M., and Potters J. Flow shop with a dominant machine. Eur. J. Oper. Res. 62 (1992) 38-46
17. Ho J.C., and Gupta J.N.D. Flow shop scheduling with dominant machines. Comput. Opl. Res. 22 (1995) 237-246
18. Xiang S., Tang G., and Cheng T.C.E. Solvable cases of permutation flow shop scheduling with dominating machines. Int. J. Prod. Econ. 66 (2000) 53-57