Skip to main content
SpringerLink
Log in

Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

  • Research paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

Bicriteria scheduling problems are of significance in both theoretical and applied aspects. It is known that the single machine bicriteria scheduling problem of minimizing total weighted completion time and maximum cost simultaneously is strongly NP-hard. In this paper we consider a special case where the jobs have equal length and present an \(O(n^{3}\log n)\) algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.

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

Similar content being viewed by others

References

  • Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin

    Book  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  Google Scholar 

  • Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623

    Article  Google Scholar 

  • Hoogeveen JA (1996) Single-machine Scheduling to minimize a function of two or three maximum cost criteria. J Algorithms 21:415–433

    Article  Google Scholar 

  • Hoogeveen JA, Van de Velde SL (1995) Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper Res Lett 17:205–208

    Article  Google Scholar 

  • Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19:544–546

    Article  Google Scholar 

  • Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3(1):59–66

    Article  Google Scholar 

  • T’kindt V, Billaut J-C (2002) Multicriteria scheduling: theory, models and algorithms. Springer, Berlin

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Henan University of Technology, Zhengzhou, 450001, Henan, China

    Cheng He & Hao Lin

  2. Department of Mathematics, Zhengzhou University, Zhengzhou, 450001, Henan, China

    Xiumei Wang

Authors
  1. Cheng He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hao Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiumei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cheng He.

Additional information

This work was supported by NSFC (Grant Nos. 11201121, 11001265, 11101383).

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, C., Lin, H. & Wang, X. Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost. 4OR-Q J Oper Res 12, 87–93 (2014). https://doi.org/10.1007/s10288-013-0244-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-013-0244-1

Keywords

Search

Navigation