Parallel dedicated machines scheduling with chain precedence constraints

Alessandro Agnetis, Hans Kellerer, Gaia Nicosia and Andrea Pacifici

European Journal of Operational Research, 2012, vol. 221, issue 2, 296-305

Abstract: A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.

Keywords: Scheduling; Parallel dedicated machines; Precedence constraints; Two-job job shop; Computational complexity (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712002500
Full text for ScienceDirect subscribers only

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:eee:ejores:v:221:y:2012:i:2:p:296-305

DOI: 10.1016/j.ejor.2012.03.040

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().