A new three-machine shop scheduling: complexity and approximation algorithm

Jianming Dong, Yong Chen, An Zhang () and Qifan Yang
Additional contact information
Jianming Dong: Zhejiang University
Yong Chen: Hangzhou Dianzi University
An Zhang: Hangzhou Dianzi University
Qifan Yang: Zhejiang University

Journal of Combinatorial Optimization, 2013, vol. 26, issue 4, No 11, 799-810

Abstract: Abstract The paper investigates a new three-machine shop scheduling problem that arises from many production systems, such as the garment assembly line, etc. In such scenarios, each job consists of three operations, each of which has to be non-preemptively processed by one specific machine. In contrast with the classical three-machine shop scheduling, the processing order of the operations of each job is partially restricted. In particular, the first two operations are ordered and all the same for all jobs, while the third operation is not restricted. The objective is to minimize the makespan. We show the problem is NP-hard in the ordinary sense and present a polynomial time approximation algorithm with a worst case performance ratio of $\frac{3}{2}$ .

Keywords: Open shop; Flow shop; Approximation algorithm; Worst-case analysis (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9485-8 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:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9485-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9485-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().