Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach

Authors:
S. H. Choi;K. Wang
Affiliations:
Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong;Department of Management Science and Engineering, Economics and Management School, Wuhan University, Wuhan, China
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 6
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods

Journal of Scheduling
The Many Ways of Facing Temporal Uncertainty in Planning and Scheduling

TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
New indices for cluster validity assessment

Pattern Recognition Letters
A neural network evaluation model for ERP performance from SCM perspective to enhance enterprise competitive advantage

Expert Systems with Applications: An International Journal
A Cluster Separation Measure

IEEE Transactions on Pattern Analysis and Machine Intelligence

Fast reactive scheduling to minimize tardiness penalty and energy cost under power consumption uncertainties

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flexible flow shop scheduling problems are NP-hard and tend to become more complex when stochastic uncertainties are taken into consideration. Although some methods have been developed to address such problems, they remain inherently difficult to solve by any single approach. This paper presents a novel decomposition-based approach (DBA), which combines both the shortest processing time (SPT) and the genetic algorithm (GA), to minimizing the makespan of a flexible flow shop (FFS) with stochastic processing times. In the proposed DBA, a neighbouring K-means clustering algorithm is developed to firstly group the machines of an FFS into an appropriate number of machine clusters, based on their stochastic nature. Two optimal back propagation networks (BPN), corresponding to the scenarios of simultaneous and non-simultaneous job arrivals, are then selectively adopted to assign either SPT or GA to each machine cluster for sub-schedule generation. Finally, an overall schedule is generated by integrating the sub-schedules of machine clusters. Computation results show that the DBA outperforms SPT and GA alone for FFS scheduling with stochastic processing times.