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.

Domaines

Modélisation et simulation

Florent Breuil : Connectez-vous pour contacter le contributeur

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

Soumis le : mercredi 19 décembre 2012-11:04:51

Dernière modification le : mardi 18 avril 2023-10:00:05

Dates et versions

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

Identifiants

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

Citer

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

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

86 Consultations

0 Téléchargements