Batch scheduling of step deteriorating jobs

Journal of Scheduling

Volumn 11, Issue 1, 2008, Pages 17-28

  Barketau, M S ^a,b,c   Cheng, T C E ^b   Ng, C T ^b   Kotov, Vladimir ^a   Kovalyov, Mikhail Y ^a,c  

^a BELARUSIAN STATE UNIVERSITY   (Belarus)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Batching; Deterioration; Open end bin packing; Scheduling

Indexed keywords

DETERIORATING JOBS; OPEN-END BIN PACKING; WAITING TIME;

APPROXIMATION ALGORITHMS; BATCH DATA PROCESSING; POLYNOMIALS;

SCHEDULING;

EID: 38349083234     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0047-3     Document Type: Article

References (12)

1. Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society, 50, 711-720.
2. Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2006, in press). A review of scheduling problems with setup times or costs. European Journal of Operational Research, available online 13 November 2006.
3. Cheng, T. C. E., & Ding, Q. (2001). Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research, 134, 623-630.
4. Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operations Research, 94, 277-283.
5. Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1-13.
6. Gawiejnowicz, S. (1996). Brief survey of continuous models of scheduling. Foundations of Computer and Decision Science, 21, 81-100.
7. Inderfurth, K., Janiak, A., Kovalyov, M. Y., & Werner, F. (2006). Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research, 33, 1595-1605.
8. Karmarkar, N., & Karp, R. M. (1982). An efficient approximation scheme for the one-dimensional bin packing problem. In Proceedings of the 23rd annual symposium on foundations of computer science (pp. 312-320). Long Beach: IEEE Computer Society.
9. Leung, J. Y.-T. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 30, 163-171.
10. Leung, J. Y.-T., Dror, M., & Young, G. H. (2001). A note on an open-end bin packing problem. Journal of Scheduling, 4, 201-207.
11. Melnikov, O. I., & Shafransky, Y. M. (1980). Parametric problem of scheduling theory. Cybernetics, 15, 352-357 (in Russian).
12. Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228-249.