Using real-time information to reschedule jobs in a flowshop with variable processing times

被引:61
作者
Framinan, Jose M. [1 ]
Fernandez-Viagas, Victor [1 ]
Perez-Gonzalez, Paz [1 ]
机构
[1] Univ Seville, Ind Management, Sch Engn, Seville, Spain
关键词
Rescheduling; Flowshop; Industry; 4.0; Variable processing times; Critical path; PERMUTATION FLOWSHOP; ALGORITHM; STRATEGIES; TARDINESS; POLICIES; MACHINE;
D O I
10.1016/j.cie.2019.01.036
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, a question arises regarding when and how this data can be used to improve scheduling decisions. While it is acknowledged that a continuous rescheduling based on the updated information may be beneficial as it serves to adapt the schedule to unplanned events, this rather general intuition has not been supported by a thorough experimentation, particularly for multi-stage manufacturing systems where such continuous rescheduling may introduce a high degree of nervousness in the system and deteriorates its performance. In order to study this research problem, in this paper we investigate how real-time information on the completion times of the jobs in a flowshop with variable processing times can be used to reschedule the jobs. In an exhaustive computational experience, we show that rescheduling policies pay off as long as the variability of the processing times is not very high, and only if the initially generated schedule is of good quality. Furthermore, we propose several rescheduling policies to improve the performance of continuous rescheduling while greatly reducing the frequency of rescheduling. One of these policies, based on the concept of critical path of a flowshop, outperforms the rest of policies for a wide range of scenarios.
引用
收藏
页码:113 / 125
页数:13
相关论文
共 34 条
[1]   Match-up scheduling under a machine breakdown [J].
Akturk, MS ;
Gorgulu, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :81-97
[2]   Executing production schedules in the face of uncertainties: A review and some future directions [J].
Aytug, H ;
Lawley, MA ;
McKay, K ;
Mohan, S ;
Uzsoy, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) :86-110
[3]   Heuristic solution methods for the stochastic flow shop problem [J].
Baker, Kenneth R. ;
Altheimer, Dominik .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 216 (01) :172-177
[4]   Three heuristic procedures for the stochastic, two-machine flow shop problem [J].
Baker, Kenneth R. ;
Trietsch, Dan .
JOURNAL OF SCHEDULING, 2011, 14 (05) :445-454
[5]  
Chen CC, 2016, IEEE SYS MAN CYBERN, P2603, DOI 10.1109/SMC.2016.7844631
[6]   ANALYSIS OF PERIODIC AND EVENT-DRIVEN RESCHEDULING POLICIES IN DYNAMIC SHOPS [J].
CHURCH, LK ;
UZSOY, R .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 1992, 5 (03) :153-163
[7]   A combined OWA-DEA method for dispatching rule selection [J].
El Bouri, Ahmed ;
Amin, Gholam R. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 88 :470-478
[9]   A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation [J].
Fernandez-Viagas, Victor ;
Ruiz, Ruben ;
Framinan, Jose M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (03) :707-721
[10]  
Framinan J. M., 2014, MANUFACTURING SCHEDU