Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We analyze two single machine scheduling problems for the case where job processing times are controllable, by allocating continuous and non-renewable resources to the processing operations. The first problem to analyze is constructing the trade-off curve between maximum lateness and total resource consumption; an O(n 2) computational time optimization algorithm was constructed to solve this problem. This algorithm was extended to solve the second problem, which is to construct the trade-off surface between maximum lateness, makespan, and total resource consumption. As part of this algorithm we identify a plane in the 3D field that is formed by the three criteria, which is parallel only to the maximum lateness, and calculate the optimal makespan and total resource consumption as functions of points on this plane. The extended algorithm keeps the same complexity of O(n 2) time. Both algorithms are very robust as they solve the problem for a very large set of resource consumption functions which has to follow only some mild (and commonly acceptable) conditions. Moreover, as far as we know, this is the first research of its kind in the field of multi-objective scheduling to present an algorithm that constructs a 3D trade-off surface.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Hoogeveen, H., & Woeginger, G. J. (2002). Some comments on sequencing with controllable processing times. Computing, 68, 181–192.

    Article  Google Scholar 

  • Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management sciences research project, research report 43, UCLA.

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Shabtay, D. (2004). A single and a two-resource allocation problem for minimizing the maximal lateness in a single machine-scheduling problem. Computers and Operations Research, 31(8), 1303–1315.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643–1666.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258–262.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, Haifa, Israel

    Liron Yedidsion

Authors
  1. Liron Yedidsion
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liron Yedidsion.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yedidsion, L. Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine. J Sched 15, 665–679 (2012). https://doi.org/10.1007/s10951-012-0290-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-012-0290-0

Keywords

Search

Navigation