Flow shop scheduling with deteriorating jobs under dominating machines

Omega

Volumn 34, Issue 4, 2006, Pages 327-336

  Wang, Ji Bo ^a,b   Xia, Zun Quan ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Dominating machines; Flow shop; Scheduling; Simple linear deterioration

Indexed keywords

MACHINE SHOP PRACTICE;

DETERIORATING JOBS; DOMINATING MACHINES; FLOW-SHOP SCHEDULING; FLOW-SHOPS; LINEAR DETERIORATION; NO WAIT; NO-IDLE FLOW SHOP; SCHEDULING; SIMPLE LINEAR DETERIORATION; SIMPLEST LINEAR;

DETERIORATION;

EID: 27844604203     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2004.10.006     Document Type: Article

References (27)

1. B. Alidaee N.K. Womer Scheduling with time dependent processing times: review and extensions Journal of the Operational Research Society 50 1999 711-720
2. T.C.E. Cheng Q. Ding B.M.T. Lin A concise survey of scheduling with time-dependent processing times European Journal of Operational Research 152 2004 1-13
3. S. Browne U. Yechiali Scheduling deteriorating jobs on a single processor Operations Research 38 1990 495-498
4. G. Mosheiov V-shaped policies for scheduling deteriorating jobs Operations Research 39 1991 979-991
5. G. Mosheiov Scheduling jobs under simple linear deterioration Computers and Operations Research 21 1994 653-659
6. P.S. Sundararaghavan A.S. Kunnathur Single machine scheduling with start time dependent processing times: Some solvable cases European Journal of Operational Research 78 1994 394-403
7. T.C.E. Cheng Q. Ding The complexity of scheduling starting time dependent task with release dates Information Processing Letters 65 1998 75-79
8. A. Bachman A. Janiak Scheduling deteriorating jobs with ready times Inderfurth In: K. Schwodiauer W. Domschke F. Juhnke P. Kleinschmidt G. Wascher editors. Operations research, Selected papers of the symposium on operations research (SOR, 1999) 2000 Springer Berlin 342-348
9. A. Bachman A. Janiak Minimizing maximum lateness under linear deterioration European Journal of Operational Research 126 2000 557-566
10. Bachman A, Janiak A. Total weighted completion time minimization in a problem of scheduling deteriorating jobs. In: Chamoni P, Leisten R, Martin A, Minnemann J, Stadtler H. editors. Operations research, selected papers of the international conference on operations research (OR 2001), Berlin: Springer; 2002, p. 265-71. Berlin 2000, p. 342-8.
11. A. Bachman A. Janiak M.Y. Kovalyov Minimizing the total weighted completion time of deteriorating jobs Information Processing Letters 81 2 2002 81-84
12. C.-C. Wu W.-C. Lee Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine Information Processing Letters 87 2003 89-93
13. Y.S. Hsu B.M.T. Lin Minimization of maximum lateness under linear deterioration Omega 31 2003 459-469
14. Z-L. Chen Parallel machine scheduling with time dependent processing times Discrete Applied Mathematics 70 1996 81-94
15. G. Mosheiov Multi-machine scheduling with linear deterioration INFOR 36 1998 205-214
16. G. Mosheiov Complexity analysis of job-shop scheduling with deteriorating jobs Discrete Applied Mathematics 117 2002 195-209
17. C.L. Zhao Q.L. Zhang H.Y. Tang Flow shop schediling problems with processing time dependent on starting time Systems Engineering and Electronics 25 2003 292-294
18. C.L. Monma A.H.G. Rinnooy Kan A concise survey of efficient solvable special cases of the permutation flowshop problem RAIRO 17 1983 105-119
19. A.V.D. Nouweland M. Krabbenborg J. Potters Flow-shops with a dominant machine European Journal of Operational Research 62 1992 38-46
20. J.C. Ho J.N.D. Gupta Flowshop scheduling with dominant machines Computers and Operations Research 22 1995 237-246
21. S. Xiang G. Tang T.C.E. Cheng Solvable cases of permutation flowshop scheduling with dominating machines International Journal of Production Economics 66 2000 53-57
22. O. Čepek M. Okada M. Vlach Nonpreemptive flowshop scheduling with machine dominance European Journal of Operational Research 139 2002 245-261
23. I. Adiri D. Pohoryles Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times Naval Research Logistics 29 1982 495-504
24. H. Rǒck The three-machine no-wait flow shop problem is NP-complete Journal of ACM 31 1984 336-345
25. J.B. Wang Z.Q. Xia No-wait or no-idle permutation flowshop scheduling with dominating machines Journal of Applied Mathematics and Computing 17 2005 419-432
26. R.L. Graham E.L. Lawler J.K. Lenstra A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 1979 287-326
27. K.R. Baker Introduction to sequencing and scheduling 1974 Wiley New York