Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2012 pp 403–408Cite as

Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations

  • Conference paper
  • First Online:

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

In this paper, we consider two dedicated parallel machines scheduling problem with precedence relations to minimize makespan. Complexity and approximation results are presented.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    For which there is no job which can be shifted to an earlier starting time without violating precedence or resource constraints.

References

  1. Scholl, A.: Balancing and Sequencing of Assembly Lines. Physica, Springer, Berlin (1999)

    Google Scholar 

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

    Article  Google Scholar 

  3. Gafarov, E.R., Dolgui, A.: Hard special case and other complexity results for SALBP-1. Research Report LIMOS UMR CNRS, p. 6158 (2012)

    Google Scholar 

  4. Gafarov, E.R., Dolgui, A.: Two customized parallel machines scheduling problem with precedence relations. Research Report LIMOS UMR CNRS (2012)

    Google Scholar 

Download references

Acknowledgments

The authors are grateful to Chris Yukna for his help regarding the English presentation.

Author information

Authors and Affiliations

  1. Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya Street 65, Moscow, Russia, 117997

    Evgeny R. Gafarov

  2. Ecole Nationale Superieure des Mines, FAYOL-EMSE CNRS:UMR6158, LIMOS, 42023, Saint-Etienne, France

    Alexandre Dolgui & Frédéric Grimaud

Authors
  1. Evgeny R. 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

  3. Frédéric Grimaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Evgeny R. Gafarov .

Editor information

Editors and Affiliations

  1. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Stefan Helber

  2. Institute for Information Systems Resear, Leibniz Universität Hannover, Hannover, Germany

    Michael Breitner

  3. Institute for Banking and Finance, Leibniz Universität Hannover, Hannover, Germany

    Daniel Rösch

  4. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Cornelia Schön

  5. Institute for Risk and Insurance, Leibniz Universität Hannover, Hannover, Germany

    Johann-Matthias Graf von der Schulenburg

  6. Institute of Statistics, Leibniz Universität Hannover, Hannover, Germany

    Philipp Sibbertsen

  7. Institute of Applied Mathematics, Leibniz Universität Hannover, Hannover, Germany

    Marc Steinbach

  8. Institute of Probability and Statistics, Leibniz Universität Hannover, Hannover, Germany

    Stefan Weber

  9. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Anja Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gafarov, E.R., Dolgui, A., Grimaud, F. (2014). Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_60

Download citation

Publish with us

Policies and ethics

Search

Navigation