Skip to main content
SpringerLink
Log in

Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We present a polynomial algorithm for a family of single-machine scheduling problems with mixed variable job processing times, \(k\)-partite job precedence constraints and the maximum cost criterion, provided that job processing times satisfy certain assumptions.

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

References

  1. Bampis, E.: The complexity of short schedules for UET bipartite graphs. RAIRO Oper Res 33(3), 367–370 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)

    MATH  Google Scholar 

  3. Debczyński, M., Gawiejnowicz, S.: Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion, in revision (2012)

  4. Gawiejnowicz, S.: Time-dependent scheduling. Springer, Berlin (2008)

    MATH  Google Scholar 

  5. Gawiejnowicz, S., Lai, T.C., Chiang, M.H.: Scheduling linearly shortening jobs under precedence constraints. Appl Math Model 35, 2005–2015 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gawiejnowicz, S., Lin, B.M.T.: Scheduling time-dependent jobs under mixed deterioration. Appl Math Comput 216(2), 438–447 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gordon, V.S., Potts, C.N., Strusevich, V.A., Whitehead, J.D.: Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11, 357–370 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kononov, A.: Single-machine scheduling problems with processing times proportional to an arbitrary function. Discret Anal Oper Res 5(3):17–37 (in Russian) (1998)

    Google Scholar 

  9. Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19(5), 544–546 (1973)

    Article  MATH  Google Scholar 

  10. Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput Oper Res 31(6), 653–659 (1994)

    Article  Google Scholar 

  11. Munier-Kordon, A.: Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. Oper Res Lett 32(6), 557–564 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Wang, J.B., Ng, C.T., Cheng, T.C.E.: Single-machine scheduling with deteriorating jobs under a series-parallel constraint. Comput Oper Res 35(8), 2684–2693 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The author would like to appreciate the referee for the valuable comments and suggestions on earlier version of this paper.

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 , Poznań, Poland

    Marek Dębczyński

Authors
  1. Marek Dębczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marek Dębczyński.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dębczyński, M. Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints. Optim Lett 8, 395–400 (2014). https://doi.org/10.1007/s11590-012-0582-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0582-5

Keywords

Search

Navigation