Skip to main content
SpringerLink
Log in

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Two-dedicated-parallel-machine scheduling problem with precedence constraints to minimize makespan is considered. This problem originally appeared as a sub-problem in assembly line balancing but it has also its own applications. Complexity and approximation results for this scheduling problem and its special cases with chains of jobs or equal-processing-times are presented.

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

Similar content being viewed by others

Notes

  1. A similar idea was used in [2] for \(P|prec,p_j=1|{C_{max}}\) problem.

  2. for the definition of SALBP-1, see Sect. 4.

References

  1. Lushchakova, I.N., Strusevich, V.A.: Scheduling incompatible tasks on two machines. Eur. J. Oper. Res. 200(2), 334–346 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  2. Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity, Report BS-8909, Stichting Matematisch Centrum, Amsterdam (1989)

  3. Lin, S.F., Chen, J.Y.: Two parallel machines scheduling. Syst. Anal. Model. Simul. 42(10), 1429–1437 (2002)

    MATH  MathSciNet  Google Scholar 

  4. Bartholdi, J.: Balancing two-sided assembly lines: a case study. Int. J. Prod. Res. 31, 2447–2461 (1993)

    Article  Google Scholar 

  5. Tapkan, P., Ozbakir, L., Baykasoglu, A.: Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem. Optim. Lett. 39(9–10), 1009–1015 (2007)

    Google Scholar 

  6. Hadda, H., Dridi, N., Hajri-Gabouj, S.: A note on the two-stage hybrid flow shop problem with dedicated machines. Optim. Lett. (2011). doi:10.1007/s11590-011-0365-4

  7. Aloulou, M.A., Kovalyov, M.Y., Portmann, M.-C.: Maximization problems in single machine scheduling. Ann. Oper. Res. 129, 21–32 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rekiek, B., Dolgui, A., Delchambre, A., Bratcu, A.: State of art of assembly lines design optimization. Annu. Rev. Control 26(2), 163–174 (2002)

    Article  Google Scholar 

  9. Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3), 666–693 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Baybars, I.: A survey of exact algorithms for the simple assembly line balancing. Manag. Sci. 32, 909–932 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gafarov, E.R., Dolgui, A.: Hard Special Case and Other Complexity Results for SALBP-1. Research Report LIMOS UMR CNRS 6158 (2012)

Download references

Acknowledgments

The work was partially supported by Saint-Etienne Méetropole, France and Labex IMOBS3. The authors thanks also Chris Yukna for his help with English.

Author information

Authors and Affiliations

  1. Ecole Nationale Superieure des Mines, CNRS UMR6158, LIMOS, 42023 , Saint-Etienne, France

    Evgeny Gafarov & Alexandre Dolgui

  2. Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya St. 65, Moscow, 117997, Russia

    Evgeny Gafarov

Authors
  1. Evgeny Gafarov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandre Dolgui
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Evgeny Gafarov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gafarov, E., Dolgui, A. Two-dedicated-machine scheduling problem with precedence relations to minimize makespan. Optim Lett 8, 1443–1451 (2014). https://doi.org/10.1007/s11590-013-0671-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-013-0671-0

Keywords

Search

Navigation