Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations

Evgeny R. Gafarov (), Alexandre Dolgui () and Frédéric Grimaud ()
Additional contact information
Evgeny R. Gafarov: Institute of Control Sciences of the Russian Academy of Sciences
Alexandre Dolgui: Ecole Nationale Superieure des Mines, FAYOL-EMSE CNRS:UMR6158, LIMOS
Frédéric Grimaud: Ecole Nationale Superieure des Mines, FAYOL-EMSE CNRS:UMR6158, LIMOS

A chapter in Operations Research Proceedings 2012, 2014, pp 403-408 from Springer

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

Keywords: Precedence Relations; Minimize Makespan; Fully Polynomial Time Approximation Scheme (FPTAS); Critical Path; Special Subcase (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_60

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_60

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().