The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Anis Gharbi, Mohamed Labidi and Mohamed Aly Louly

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/273567

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:wly:jnljam:v:2014:y:2014:i:1:n:273567

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().