The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

Annals of Operations Research

Volumn 159, Issue 1, 2008, Pages 25-40

  Shabtay, Dvir ^a   Steiner, George ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Controllable processing times; Due date assignment; Earliness tardiness scheduling; Resource allocation; Single machine scheduling

Indexed keywords

EID: 38749154324     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0269-y     Document Type: Article

References (31)

1. Adamopoulos, G. I., & Pappis, C. P. (1996). Single machine scheduling with flow allowances. Journal of the Operational Research Society, 47, 1280-1285.
2. Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, 335-341.
3. Armstrong, R., Gu, S., & Lei, L. (1995). An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. Journal of the Operational Research Society, 46, 116-122.
4. Armstrong, R., Gu, S., & Lei, L. (1997). Solving a class of two-resource allocation problem by equivalent load method. Journal of the Operational Research Society, 48, 818-825.
5. Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38, 22-36.
6. Biskup, D., & Jahnke, H. (2001). Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics, 69, 317-322.
7. Cheng, T. C. E., Oǧaz, C., & Qi, X. D. (1996). Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics, 43, 29-35.
8. Daniels, R. L. (1990). A multi-objective approach to resource allocation in single machine scheduling. European Journal of Operational Research, 48, 226-241.
9. Gordon, V., Proth, J. M., & Chu, C. B. (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1-25.
10. Gordon, V., Proth, J. M., & Chu, C. B. (2002b). Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning and Control, 13(2), 117-132.
11. Gupta, Y. P., Bector, C. R., & Gupta, M. C. (1990). Optimal schedule on a single machine using various due date determination methods. Computers in Industry, 15(3), 245-253.
12. Hall, N. G., & Posner, M. (1991). Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Operations Research, 39(5), 836-846.
13. Hardy, G. H., Littlewood, J. E., & Polya, G. (1934). Inequalities. Cambridge: Cambridge University Press.
14. Hoogeveen, H., & Woeginger, G. J. (2002). Some comments on sequencing with controllable processing times. Computing, 68, 181-192.
15. Janiak, A. (1987). One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, 23(4), 289-293.
16. Monma, C.L., Schrijver, A., Todd, M. J., & Wei, V. K. (1990). Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research, 15, 736-748.
17. Ng, C. T. D., Cheng, T. C. E., Kovalyov, M. Y., & Lam, S. S. (2003). Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research, 30, 1173-1185.
18. Nowicki, E., & Zdrzalka, S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, 271-287.
19. Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391-399.
20. Panwalkar, S. S., & Rajagopalan, R. (1992). Single-machine sequencing with controllable processing times. European Journal of Operational Research, 59, 298-302.
21. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Englewood Cliffs: Prentice-Hall.
22. Scott, S. C., & Jefferson, T. R. (1995). Allocation of resources in project management. International Journal of Systems Science, 26(2), 413-420.
23. Seidmann, A., Panwalkar, S. S., & Smith, M. L. (1981). Optimal assignment of due dates for a single processor scheduling problem. International Journal of Production Research, 19, 393-399.
24. Shabtay, D. (2004). Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem. Computers and Operations Research, 31(8), 1303-1315.
25. Shabtay, D., & Kaspi, M. (2004). Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research, 31(13), 2279-2289.
26. Shabtay, D., & Steiner, G. (2006). Two due date assignment problems in scheduling a single machine. Operations Research Letters, 34(6), 683-691.
27. Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643-1666.
28. Slotnick, S. A., & Sobel, M. J. (2005). Manufacturing lead-time rules: Customer retention versus tardiness costs. European Journal of Operational Research, 169, 825-856.
29. Van Wassenhove, L., & Baker, K. R. (1982). A bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research, 11, 48-54.
30. Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258-262.
31. Wan, G., Yen, B. P. C., & Li, C. L. (2001). Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Information Processing Letters, 79, 273-280.