Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine

Journal of Scheduling

Volumn 15, Issue 6, 2012, Pages 665-679

  Yedidsion, Liron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bi criteria; Convex resource allocation; Makespan; Maximum lateness; Multi objective; Single machine scheduling; Tri criteria

Indexed keywords

BI-CRITERIA; MAKESPAN; MAXIMUM LATENESS; MULTI OBJECTIVE; SINGLE-MACHINE SCHEDULING; TRI-CRITERIA;

MACHINERY; SCHEDULING ALGORITHMS; THREE DIMENSIONAL COMPUTER GRAPHICS;

PROBLEM SOLVING;

EID: 84870558388     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-012-0290-0     Document Type: Article

References (14)

1. Cheng, T. C. E., Chen, Z. L., & Li, C. L. (1996). Single-machine scheduling with trade-off between number of tardy jobs and resource consumption. Operations Research Letters, 19, 237-242. (Pubitemid 126395668)
2. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
3. Hoogeveen, H., & Woeginger, G. J. (2002). Some comments on sequencing with controllable processing times. Computing, 68, 181-192. (Pubitemid 34550660)
4. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management sciences research project, research report 43, UCLA.
5. Kaspi, M., & Shabtay, D. (2005). A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers and Operations Research, 33(10), 3015-3033. (Pubitemid 43199838)
6. Lee, C. Y., & Lei, L. (2001). Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Annals of Operations Research, 102, 287-307.
7. 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.
8. 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. Computer and Operations Research, 30, 1173-1185. (Pubitemid 36346003)
9. Shabtay, D. (2004). A single and a two-resource allocation problem for minimizing the maximal lateness in a single machinescheduling problem. Computers and Operations Research, 31(8), 1303-1315. (Pubitemid 38356034)
10. 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. (Pubitemid 38791075)
11. Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643-1666. (Pubitemid 47176128)
12. 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. (Pubitemid 13473998)
13. Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258-262. (Pubitemid 11447761)
14. Yedidsion, L., Shabtay, D., & Kaspi, M. (2007). A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of Scheduling, 10(6), 341-352. (Pubitemid 350015101)