Open Access
Translator Disclaimer
2014 The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures
Anis Gharbi, Mohamed Labidi, Mohamed Aly Louly
J. Appl. Math. 2014: 1-14 (2014). DOI: 10.1155/2014/273567

Abstract

We consider the makespan minimization in a flowshop environment where the job sequence does not have to be the same for all the machines. Contrarily to the classical permutation flowshop scheduling problem, this strongly NP-hard problem received very scant attention in the literature. In this paper, some improved single-machine-based adjustment procedures are proposed, and a new two-machine-based one is introduced. Based on these adjustments, new lower and upper bounding schemes are derived. Our experimental analysis shows that the proposed procedures provide promising results.

Citation

Download Citation

Anis Gharbi. Mohamed Labidi. Mohamed Aly Louly. "The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures." J. Appl. Math. 2014 1 - 14, 2014. https://doi.org/10.1155/2014/273567

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131469
MathSciNet: MR3285185
Digital Object Identifier: 10.1155/2014/273567

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
14 PAGES


SHARE
Vol.2014 • 2014
Back to Top