A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine

International Journal of Production Economics

Volumn 119, Issue 2, 2009, Pages 298-307

  Yedidsion, Liron ^a   Shabtay, Dvir ^b   Korach, Ephraim ^b   Kaspi, Moshe ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Complexity; Controllable processing times; Deterministic scheduling; Resource allocation

Indexed keywords

BI-CRITERIA; COMPLEXITY; CONTROLLABLE PROCESSING TIMES; DETERMINISTIC SCHEDULING; JOB PROCESSING TIME; NON-RENEWABLE RESOURCE; NP-HARD; NUMBER OF TARDY JOBS; POLYNOMIAL-TIME ALGORITHMS; PROCESSING OPERATIONS; RESOURCE CONSUMPTION; RESOURCE-DEPENDENT PROCESSING TIME; ROBUST ANALYSIS; SCHEDULING PROBLEM; SINGLE MACHINES; TRADE-OFF CURVES;

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; INDUSTRIAL RESEARCH; PLANNING; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

COMPUTER RESOURCE MANAGEMENT;

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

References (24)

1. Armstrong R., Gu S., and Lei L. An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. Journal of the Operational Research Society 46 (1995) 116-122
2. Armstrong R., Gu S., and Lei L. Solving a class of two-resource allocation problems by equivalent load method. Journal of the Operational Research Society 48 (1997) 818-825
3. Biskup D., and Jahnke H. Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics 69 (2001) 317-322
4. Chen Z.L., Lu Q., and Tang G. Single machine scheduling with discretely controllable processing times. Operations Research Letters 21 (1997) 69-76
5. Cheng T.C.E., Chen Z.L., and Li C.L. Single-machine scheduling with trade-off between number of tardy jobs and resource consumption. Operations Research Letters 19 (1996) 237-242
6. Cheng T.C.E., Oǧaz C., and Qi X.D. Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 43 (1996) 29-35
7. Cheng T.C.E., Chen Z.L., Li C.L., and Lin B.M.T. Scheduling to minimize the total compression and late costs. Naval Research Logistics 45 (1998) 67-82
8. Daniels R.L., and Sarin R.K. Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research 37 6 (1989) 981-984
9. 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 3 (1979) 287-326
10. He, Y., Wei, Q., Cheng, T.C.E., 2006. Single-machine scheduling with trade-off between number of tardy jobs and compression cost. Journal of Scheduling 10, 303-310.
11. Janiak A. One-machine scheduling with allocation of continuously divisible resource and with no precedence constraints. Kybernetika 23 4 (1987) 289-293
12. Kaspi M., and Shabtay D. A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers & Operations Research 33 10 (2006) 3015-3033
13. Lee I.S. Single machine scheduling with controllable processing times: a parametric study. International Journal of Production Economics 22 (1991) 105-110
14. Lee C.Y., and Lei L. Multiple-project scheduling with controllable project duration and hard resource constraint some solvable cases. Annals of Operations Research 102 (2001) 287-307
15. Monma C.l., Schrijver A., Todd M.J., and Wei V.K. Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research 15 (1990) 736-748
16. Moore J.M. An n job, one-machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 334-342
17. Scott S.C., and Jefferson T.R. Allocation of resources in project management. International Journal of Systems Science 26 2 (1995) 413-420
18. Shabtay D. A single and a two-resource allocation problem for minimizing the maximal lateness in a single machine-scheduling problem. Computers & Operations Research 31 8 (2004) 1303-1315
19. Shabtay D., and Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & Operations Research 31 13 (2004) 2279-2289
20. Shabtay D., and Steiner G. Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling 10 (2007) 255-261
21. Su L.H., and Lien C.Y. Scheduling parallel machines with resource-dependent processing times. International Journal of Production Economics 117 2 (2009) 256-266
22. Van Wassenhove L., and Baker K.R. A bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research 11 (1982) 48-54
23. Vickson R.G. Two single machine sequencing problems involving controllable job processing times. AIIE Transactions 12 3 (1980) 258-262
24. Yedidsion L., Shabtay D., and Kaspi M. A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of Scheduling 10 6 (2006) 341-352