NP-hard cases in scheduling deteriorating jobs on dedicated machines

Journal of the Operational Research Society

Volumn 52, Issue 6, 2001, Pages 708-717

  Kononov, A ^a   Gawiejnowicz, S ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Deteriorating jobs; Flow shop; Makespan; NP hardness; Open shop

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; THEOREM PROVING;

DEDICATED MACHINES; DETERIORATING JOBS; FLOW SHOP PROBLEM; MAKESPAN; OPEN SHOP PROBLEM;

JOB ANALYSIS;

EID: 0035365406     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601117     Document Type: Article

References (30)

1. Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison-Wesley: Reading, MA.
2. Sriskandarajah C and Goyal SK (1989). Scheduling of a two-machine flow-shop with processing time linearly dependent on job waiting-time. J Opl Res Soc 40: 907-921.
3. Sriskandarajah C and Wagneur E (1991). The hierarchical control of the two-machine flowshop with state dependent processing times. Complexity analysis and approximate algorithms. Infor 29: 193-205.
4. Wagneur E and Sriskandarajah C (1993). Optimal control of a class of DEDS: flow-shops with state-dependent processing times. Discr Event Dyn Syst. Theor Appl 3: 397-425.
5. Wagneur E and Sriskandarajah C (1993). The two-machine permutation flow shop with state-dependent processing times. Nav Res Logist 40: 697-717.
6. Finke G and Jiang H (1997). A variant of the permutation flow shop model with variable processing times. Discr Appl Math 76: 123-140.
7. Melnikov OI and Shafransky YM (1979). Parametric problem of scheduling theory. Kibernetika 6: 53-57. (Engl. transl. 1980 Cybernetics 15: 352-357.)
8. Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: review and extensions. J Opl Res Soc 50: 711-720.
9. Gawiejnowicz S (1996). Brief survey of continuous models of scheduling. Found Comput Dec Sci 21: 81-100.
10. Browne S and Yechiali U (1990). Scheduling deteriorating jobs on a single processor. Opns Res 38: 495-498.
11. Gawiejnowicz S and Pankowska L (1995). Scheduling jobs with varying processing times. Inform Process Lett 54: 175-178.
12. Kononov A (1996). Combinatorial complexity of scheduling jobs with simple linear deterioration. Discr Anal Oper Res 3: 15-32 (in Russian).
13. Kononov A (1997). Scheduling problems with linear processing times. In: Zimmermann U et al (eds). Operations Research Proceedings 1996. Selected Papers of the Symposium on Operations Research (SOR 96). Springer: Berlin, pp 208-212.
14. Mosheiov G (1991). V-shaped policies to schedule deteriorating jobs. Opns Res 39: 979-991.
15. Mosheiov G (1994). Scheduling jobs under simple linear deterioration. Comput Opns Res 21: 653-659.
16. Alidaee B (1990). A heuristic solution procedure to minimize makespan on a single machine with non-linear cost. J Opl Res Soc 41: 1065-1068.
17. Gupta JND and Gupta SK (1988). Single facility scheduling with nonlinear processing times. Compu Ind Engng 14: 387-393.
18. Kononov A (1997). On schedules of a single machine jobs with processing times nonlinear in time. In: Korshunov AD (ed). Operations Research and Discrete Analysis. Kluwer: Dordrecht, pp 109-122.
19. Kononov A (1998). Single machine scheduling problems with processing times proportional to an arbitrary function. Discr Anal Oper Res 5: 17-37 (in Russian).
20. Kubiak W and van de Velde S (1998). Scheduling deteriorating jobs to minimize makespan. Nav Res Logist 45: 511-523.
21. Kunnathur AS and Gupta SK (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Euro J Opl Res 47: 56-64.
22. Sundararaghavan PS and Kunnathur AS (1994). Single machine scheduling with start time dependent processing times: some solvable cases. Euro J Opl Res 78: 394-403.
23. Cheng TCE and Ding Q (1998). The complexity of scheduling starting time dependent tasks with release times. Inform Process Lett 65: 75-79.
24. Chen Z-L (1996). Parallel machine scheduling with time dependent processing times. Discr Appl Math 70: 81-93 (erratum: Discr Appl Math 75: 103).
25. Mosheiov G (1998). Scheduling linearly deteriorating jobs on multiple machines. Infor 36: 205-214.
26. BlaZewicz J et al (1996). Scheduling Computer and Manufacturing Processes. Springer: Berlin.
27. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman: San Francisco.
28. Hsieh Y-C and Bricker DL (1997). Scheduling deteriorating jobs on multiple machines. Computer Ind Engng 32: 727-734.
29. Cai J-Y, Cai P and Zhu Y (1998). On a scheduling problem of time deteriorating jobs. J Complex 14: 190-209.
30. Kovalyov MY and Kubiak W (1998). A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. JHeurist 3: 287-297.