Approximation results for the two-machine job shop under limited machine availability

Hatem Hadda ()
Additional contact information
Hatem Hadda: Université de Tunis El Manar

OPSEARCH, 2017, vol. 54, issue 3, No 11, 662 pages

Abstract: Abstract This paper tackles the two-machine job shop scheduling problem with limited machine availability under the resumable scenario. We provide a number of characterizations for the optimal solution. We also develop polynomial-time approximation schemes for two particular configurations and identify a polynomially solvable case.

Keywords: Job shop; Flow shop; Scheduling; Availability constraint; Approximation schemes; 90B35 Scheduling theory; deterministic; 68W40 Analysis of algorithms (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-017-0298-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:opsear:v:54:y:2017:i:3:d:10.1007_s12597-017-0298-5

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-017-0298-5

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().