The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures
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,...
Main Authors: | Anis Gharbi, Mohamed Labidi, Mohamed Aly Louly |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/273567 |
Similar Items
-
Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
by: Lotfi Hidri, et al.
Published: (2014-01-01) -
A New Lower Bound Scheme for Production Scheduling in Flowshops
by: Jia-Ming Wu, et al.
Published: (2003) -
MILP Models for Flowshop Scheduling Problems
by: Jiam-Jie Liou, et al.
Published: (2010) -
The Investigation of Group Scheduling Problem on Flowshop
by: Tsung-Ming Chen, et al. -
Flowshop Scheduling Problems with Blocking Constraint
by: Wen-Hsuan Fang, et al.