Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1090-1099

  Leung, Joseph Y T ^a   Ng, C T ^b   Cheng, T C Edwin ^b  

^a New Jersey Institute of Technology   (United States)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Batch scheduling; Deteriorating processing times; Performance guarantee; Strong NP hardness; Sum of completion times

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BATCH SCHEDULING; COMPLETION TIMES; PERFORMANCE GUARANTEE; PROCESSING TIMES;

SCHEDULING;

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

References (5)

1. A. Allahverdi, C.T. Ng, T.C.E. Cheng, M.Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, in press, doi:10.1016/j.ejor.2006.06.060.
2. M.S. Barketau, T.C.E. Cheng, C.T. Ng, Batch scheduling of step deteriorating items, Working Paper, Department of Logistics, The Hong Kong Polytechnic University, 2005.
3. 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
4. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco
5. Potts C.N., and Kovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research 120 (2000) 228-249