An improved two-machine flowshop scheduling with intermediate transportation

Jianming Dong, Xueshi Wang, Jueliang Hu and Guohui Lin ()
Additional contact information
Jianming Dong: Zhejiang Sci-Tech University
Xueshi Wang: Zhejiang Sci-Tech University
Jueliang Hu: Zhejiang Sci-Tech University
Guohui Lin: Zhejiang Sci-Tech University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 3, No 23, 1316-1334

Abstract: Abstract A two-machine flowshop scheduling problem with intermediate transportation is investigated in this paper, where jobs of varying sizes finished on the first machine need to be transported to the other machine for further processing. One service vehicle of a limited capacity is used for transportation between the two machines. The problem objective is to minimize the makespan, that is the finishing time of the last job on the second machine. Using a better bin-packing algorithm and balancing between two schedules, we present an $$\frac{11}{5}$$ 11 5 -approximation algorithm for the problem, which improves the previously best $$\frac{7}{3}$$ 7 3 -approximation algorithm by Gong and Tang.

Keywords: Flowshop scheduling; Bin-packing; Approximation algorithm; Worst-case performance analysis (search for similar items in EconPapers)
Date: 2016
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-014-9825-y 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:31:y:2016:i:3:d:10.1007_s10878-014-9825-y

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

DOI: 10.1007/s10878-014-9825-y

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