Exact exponential algorithms for 3-machine flowshop scheduling problems

Lei Shang (), Christophe Lenté (), Mathieu Liedloff () and Vincent T’Kindt ()
Additional contact information
Lei Shang: Université François-Rabelais de Tours
Christophe Lenté: Université François-Rabelais de Tours
Mathieu Liedloff: Université d’Orléans
Vincent T’Kindt: Université François-Rabelais de Tours

Journal of Scheduling, 2018, vol. 21, issue 2, No 7, 227-233

Abstract: Abstract In this paper, we focus on the design of an exact exponential time algorithm with a proved worst-case running time for 3-machine flowshop scheduling problems considering worst-case scenarios. For the minimization of the makespan criterion, a Dynamic Programming algorithm running in $${\mathcal {O}}^*(3^n)$$ O ∗ ( 3 n ) is proposed, which improves the current best-known time complexity $$2^{{\mathcal {O}}(n)}\times \Vert I\Vert ^{{\mathcal {O}}(1)}$$ 2 O ( n ) × ‖ I ‖ O ( 1 ) in the literature. The idea is based on a dominance condition and the consideration of the Pareto Front in the criteria space. The algorithm can be easily generalized to other problems that have similar structures. The generalization on two problems, namely the $$F3\Vert f_\mathrm{max}$$ F 3 ‖ f max and $$F3\Vert \sum f_i$$ F 3 ‖ ∑ f i problems, is discussed.

Keywords: Moderately exponential algorithms; Dynamic programming; Flowshop (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-017-0524-2 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:jsched:v:21:y:2018:i:2:d:10.1007_s10951-017-0524-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-017-0524-2

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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