کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134443 | 956068 | 2012 | 12 صفحه PDF | دانلود رایگان |
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.
► We develop a decomposition-based approach (DBA) for flexible flow shop scheduling.
► DBA combines and exploits SPT rule and GA to deal with stochastic processing times.
► A neighbouring K-means clustering algorithm groups machines into clusters.
► Two back propagation networks assigns either SPT or GA to solve each machine cluster.
► DBA outperforms SPT and GA alone for FFS scheduling with stochastic processing times.
Journal: Computers & Industrial Engineering - Volume 63, Issue 2, September 2012, Pages 362–373