The proportionate two-machine no-wait job shop scheduling problemAuthor-Name: Koulamas, Christos

S.S. Panwalkar

European Journal of Operational Research, 2016, vol. 252, issue 1, 131-135

Abstract: We consider the two-machine no-wait job shop minimum makespan scheduling problem. We show that when each job has exactly two equal length operations (also called a proportionate job shop), the problem is solvable in O(nlog n) time. We also show that the proportionate problem becomes strongly NP-hard when some jobs are allowed to visit only one machine. Finally, we show that the proportionate problem with missing operations becomes solvable in O(nlog n) time when all missing operations are on the same machine.

Keywords: Job shop; No-wait; Proportionate (search for similar items in EconPapers)
Date: 2016
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/S0377221716000175
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:252:y:2016:i:1:p:131-135

DOI: 10.1016/j.ejor.2016.01.010

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