A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs

International Journal of Production Economics

Volumn 109, Issue 1-2, 2007, Pages 180-184

  Kang, Liying ^a,b   Ng, C T ^b  

^a SHANGHAI UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Deteriorating jobs; Fully polynomial time approximation scheme; Parallel machine scheduling

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SCHEDULING;

DETERIORATING JOBS; FULLY POLYNOMIAL-TIME APPROXIMATION SCHEME; PARALLEL-MACHINE SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 34250866835     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2006.11.014     Document Type: Article

References (17)

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. Cai J.Y., Cai P., and Zhu Y. On a scheduling problem of deteriorating jobs. Journal of Complexity 14 (1998) 190-209
3. Chen Z.L. Parallel machine scheduling with time-dependent processing times. Discrete Applied Mathematics 70 (1996) 81-93
4. Chen Z.L. Erratum to parallel machine scheduling with time-dependent processing times. Discrete Applied Mathematics 75 (1997) 103
5. Cheng T.C.E., Ding Q., Kovalyov M.Y., Bachman A., and Janiak A. Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics 50 (2003) 531-554
6. 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
7. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
8. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14 (1988) 387-394
9. Gupta S.K., Kunnathur A.S., and Dandapani K. Optimal repayment policies for multiple loans. OMEGA 15 (1987) 323-330
10. Hsieh Y.C., and Bricker D.L. Scheduling linearly deteriorating jobs on multiple machines. Computers and Industrial Engineering 32 (1997) 727-734
11. Inderfurth, K., Kovalyor, M.Y., Ng, C.T., Werner, F., 2007. Cost minimizing scheduling of work and rework process on a single facility under deterioration of reworkables. International Journal of Production Economics.
12. Kononov A., and Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines. Journal of the Operational Research Society 52 (2001) 708-717
13. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 3 (1998) 287-297
14. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
15. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 (2002) 195-209
16. Wu C.C., and Lee W.C. Two machine flowshop scheduling to minimize mean flow time under linear teterioration. International Journal of Production Economics 103 (2006) 572-584
17. Yang H.L. A comparison among various partial backlogging inventory lot-size models for deteriorating items on the basis of maximum profit. International Journal of Production Economics 96 (2005) 119-128