Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations

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

Domains

Modeling and Simulation

Florent Breuil : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-00766896

Submitted on : Wednesday, December 19, 2012-11:04:51 AM

Last modification on : Tuesday, September 17, 2024-3:45:31 PM

Dates and versions

emse-00766896 , version 1 (19-12-2012)

Identifiers

HAL Id : emse-00766896 , version 1
DOI : 10.1007/978-3-319-00795-3_60

Cite

Evgeny R. Gafarov, Alexandre Dolgui, Frédéric Grimaud. Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations. International Annual Conference of the German Operations Research Society (OR'2012), Sep 2012, Hannovre, Germany. pp 403-408, ⟨10.1007/978-3-319-00795-3_60⟩. ⟨emse-00766896⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE PRES_CLERMONT CNRS UR-LSTI-ENSMSE ROGI-ENSMSE FAYOL-ENSMSE LIMOS DEMO-ENSMSE TDS-MACS CLERMONT-AUVERGNE-INP INSTITUT-MINES-TELECOM

111 View

0 Download