A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

A. Sedeño-Noda, D. Alcaide López de Pablo and C. González-Martín

European Journal of Operational Research, 2009, vol. 196, issue 1, 140-154

Abstract: This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan and the considered bicriteria problems are solved. Finally, the computational complexity of the algorithm and a numerical example are reported.

Keywords: 90B35; 90B10; 90C27; Pre-emptive; open-shop; scheduling; Bicriteria; optimization; Network; flow; approach; Time-windows; Max-flow; parametrical; algorithm (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00246-4
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:196:y:2009:i:1:p:140-154

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 ().