Proactive approach to address the uncertainty in short-term scheduling

被引:20
作者
Bonfill, A. [1 ]
Espuna, A. [1 ]
Puigjaner, L. [1 ]
机构
[1] Univ Politecn Cataluna, ETSEIB, Dept Chem Engn, E-08028 Barcelona, Spain
关键词
proactive scheduling; rescheduling; robustness; uncertainty;
D O I
10.1016/j.compchemeng.2007.08.014
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The identification of reliable schedules serves a valuable function as a basis for coordinating outside activities within the highly dynamic and uncertain supply chain (SC) environment. A contribution is made in the area of proactive scheduling with the development of a stochastic modeling framework to support the short-term scheduling problem with uncertain operation times and equipment breakdowns. A set of scenarios for the uncertain parameters is anticipated in the decision stage, along with information concerning the reactive scheduling approach to be taken during schedule execution. A robust predictive schedule is pursued, with the flexibility to absorb disruptive events without major changes when rescheduling is required. Either rigorous or heuristic techniques can be used to optimize a robustness measure that explicitly accounts for the eventual wait times and idle times that may arise during execution. The application of the framework to different case studies shows the flexibility of the predictive schedule, the different decisions that can be drawn based on the rescheduling strategy considered, and the importance of exploiting the information of the uncertainty as well as the incorporation of the rescheduling policy proactively. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1689 / 1706
页数:18
相关论文
共 46 条
[1]   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
[2]  
Baeck T., 1997, HDB EVOLUTIONARY COM
[3]   A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times [J].
Balasubramanian, J ;
Grossmann, IE .
COMPUTERS & CHEMICAL ENGINEERING, 2002, 26 (01) :41-57
[4]  
BJORKQVIST J, 2005, CAPE FORUM
[5]   Addressing robustness in scheduling batch processes with uncertain operation times [J].
Bonfill, A ;
Espuña, A ;
Puigjaner, L .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2005, 44 (05) :1524-1534
[6]   Risk management in the scheduling of batch plants under uncertain market demand [J].
Bonfill, A ;
Bagajewicz, M ;
Espuña, A ;
Puigjaner, L .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2004, 43 (03) :741-750
[7]  
CANTON J, 2003, THESIS U POLITECNICA
[8]  
CHIPPERFIELD A, 1994, GENETIC ALGORITHM TO
[9]  
Davenport A. J., 2001, P 6 EUR C PLANN ECP
[10]   A novel sampling approach to combinatorial optimization under uncertainty [J].
Diwekar, UM .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2003, 24 (2-3) :335-371