Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times

IIE Transactions (Institute of Industrial Engineers)

Volumn 42, Issue 3, 2010, Pages 221-231

  Leyvand, Yaron ^a   Shabtay, Dvir ^a   Steiner, George ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Bicriteria scheduling; Controllable processing times; Delivery time quotation; Resource allocation

Indexed keywords

BICRITERIA SCHEDULING; CONTROLLABLE PROCESSING TIME; DECISION VARIABLES; DELIVERY TIME; DELIVERY TIME QUOTATION; DUE DATES; DUE-DATE ASSIGNMENT; JOB PROCESSING TIME; LINEAR FUNCTIONS; NP-HARD; OBJECTIVE FUNCTIONS; PARETO OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIALLY SOLVABLE SPECIAL CASE; RESOURCE CONSUMPTION; SCHEDULING PROBLEM; TOTAL TARDINESS; TOTAL WEIGHTED NUMBER OF TARDY JOBS;

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

COMPUTER RESOURCE MANAGEMENT;

EID: 77649306890     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170903394322     Document Type: Article

References (28)

1. Adamopoulos, G.I. and Pappis, C.P. (1996) Single machine scheduling with flow allowances. Journal of the Operational Research Society, 47, 1280-1285.
2. Alidaee, B. and Ahmadian, A. (1993) Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, 335-341.
3. Baker, K.R. and Scudder, G.D. (1990) Sequencing with earliness and tardiness penalties: a review. Operations Research, 38, 22-36.
4. Biskup, D. and 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.
5. De, P., Ghosh, J.B. andWells,C.E. (1991) Optimal delivery time quotation and order sequencing. Decision Sciences, 22, 379-390.
6. Gordon, V.S, Proth, J.M. and Chu, C.B. (2002) A survey of the state-ofthe-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1-25.
7. Gordon, V.S., Proth, J.M. and Strusevich, V.A. (2004) Scheduling with due date assignment, in Handbook of Scheduling: Algorithms,Models and Performance Analysis, Leung, J.Y.T (ed), CRC Press, Boca Raton, FL, pp. 21-1-21-22.
8. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
9. Janiak, A. (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, 23(4), 289-293.
10. Janiak, A. and Kovalyov,M.Y. (1996) Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94, 284-291.
11. Janiak, A., Kovalyov, M.Y. and Marek, M. (2007) Soft due window assignment and scheduling on parallelmachines. IEEE Transactions on Systems,Man and Cybernetics, Part A: Systems and Humans, 37, 614-620.
12. Janiak, A. and Winczaszek, M. (2004) A single processor scheduling problem with a common due window assignment, in Operations Research Proceedings 2004, den Hertog, D., Fleuren, H. and Kort, P. (eds), Springer, Berlin, pp. 213-220.
13. Kahlbacher, H.G. and Cheng, T.C.E. (1993) Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Applied Mathematics, 47, 139-164.
14. Kaminsky, P. and Hochbaum, D. (2004) Due date quotation models and algorithms, in Handbook of Scheduling: Algorithms,Models and Performance Analysis, Leung, J.Y.T. (ed), CRC Press, Boca Raton, FL, pp. 20-1-20-22.
15. Ng, C.T.D., Cheng, T.C.E., Janiak, A. and Kovalyov, M.Y. (2005) Group scheduling with controllable setup and processing times: minimizing total weighted completion time. Annals of Operations Research, 133, 163-174.
16. Ng, C.T.D., Cheng, T.C.E., Kovalyov, M.Y. and Lam, S.S. (2003) Single machine scheduling with a variable common due date and resourcedependent processing times. Computers & Operations Research, 30, 1173-1185.
17. Nowicki, E. and Zdrzalka, S. (1990) A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, 271-287.
18. Panwalkar, S.S., Smith,M.L. and Seidmann, A. (1982)Commondue date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391-399.
19. Sahni, S. (1976) Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116-127.
20. Seidmann, A., Panwalkar, S.S. and Smith, M.L. (1981) Optimal assignment of due dates for a single processor scheduling problem. International Journal of Production Research, 19, 393-399.
21. Shabtay, D. and Kaspi, M. (2006) Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173(1), 92-107.
22. Shabtay, D. and Steiner, G. (2007a) Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a singlemachine. Manufacturing & Service Operations Management, 9(3), 332-350.
23. Shabtay, D. and Steiner, G. (2007b) A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643-1666.
24. Shakhlevich, N.V. and Strusevich, V.A. (2005) Preemptive scheduling problems with controllable processing times. Journal of Scheduling, 8, 233-253.
25. Shakhlevich, N.V. and Strusevich, V.A. (2006) Single machine scheduling with controllable release and processing times. Discrete Applied Mathematics, 154, 2178-2199.
26. Slotnick, S.A. and Sobel, M.J. (2005) Manufacturing lead-time rules: customer retention versus tardiness costs. European Journal of Operational Research, 169, 825-856.
27. Strauss, M. (2006) Loblaw to levy fines in crackdown on suppliers. The Globe and Mail, Toronto, Canada, October 16.
28. Trick, M. (1994) Scheduling multiple variable-speed machines. Operations Research, 42, 234-248.