A project scheduling approach to production planning with feeding precedence relations

被引:42
作者
Alfieri, Arianna [3 ]
Tolio, Tullio [2 ]
Urgo, Marcello [1 ]
机构
[1] Politecn Milan, Dept Mech Engn, Mfg & Prod Syst Div, I-20133 Milan, Italy
[2] CNR, Inst Ind Technol & Automat, Milan, Italy
[3] Politecn Torino, Prod Syst & Econ Dept, Turin, Italy
关键词
scheduling; sequencing; simulation; stochastic models; stochastic methods; tabu search; VARIABLE-INTENSITY ACTIVITIES; NODE NETWORKS; CONSTRAINTS;
D O I
10.1080/00207541003604844
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In Manufacturing-to-Order or Engineering-to-Order systems producing complex and highly customised items, each item has its own characteristics that are often tailored for a specific customer. Project scheduling approaches are suitable for production planning in such environments. However, when we consider the production of complex items, the distinct production operations are often aggregated into activities representing whole production phases. In such cases, the planning and scheduling problem works on the aggregate activities, considering that, in most cases, such activities also have to be manually executed. Moreover, simple finish-to-start precedence relations no longer correctly represent the real production process, but overlapping among activities should be allowed. In this paper, a project scheduling approach is proposed for production planning in Manufacturing-to-Order systems. The Variable Intensity formulation is used to allow the effort committed to the execution of activities to vary over time. Feeding precedences are developed to model generalised precedence relations when the execution mode of activities is not known a priori. Two mathematical formulations of these precedence relations are proposed. The formulations are applied both to randomly generated instances and to an industrial system producing machining centres and are compared in terms of computational efficiency.
引用
收藏
页码:995 / 1020
页数:26
相关论文
共 20 条
[1]   The multi-mode resource-constrained project scheduling problem with generalized precedence relations [J].
De Reyck, B ;
Herroelen, W .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (02) :538-556
[2]   RanGen: A random network generator for activity-on-the-node networks [J].
Demeulemeester, E ;
Vanhoucke, M ;
Herroelen, W .
JOURNAL OF SCHEDULING, 2003, 6 (01) :17-38
[3]   A branch-and-bound procedure for the generalized resource-constrained project scheduling problem [J].
Demeulemeester, EL ;
Herroelen, WS .
OPERATIONS RESEARCH, 1997, 45 (02) :201-212
[4]  
Elmaghraby S.E., 1977, Activity Networks
[5]   THE ANALYSIS OF ACTIVITY NETWORKS UNDER GENERALIZED PRECEDENCE RELATIONS (GPRS) [J].
ELMAGHRABY, SE ;
KAMBUROWSKI, J .
MANAGEMENT SCIENCE, 1992, 38 (09) :1245-1263
[6]  
Hans E. W., 2001, THESIS U TWENTE
[7]   A branch-and-cut algorithm for scheduling of projects with variable-intensity activities [J].
Kis, T .
MATHEMATICAL PROGRAMMING, 2005, 103 (03) :515-539
[8]  
Kis T, 2006, INT SER OPER RES MAN, V92, P105, DOI 10.1007/978-0-387-33768-5_5
[9]   Project scheduling with time-varying resource constraints [J].
Klein, R .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (16) :3937-3952
[10]   RESOURCE-CONSTRAINED SCHEDULING OF PROJECTS WITH VARIABLE-INTENSITY ACTIVITIES [J].
LEACHMAN, RC ;
DINCERLER, A ;
KIM, SY .
IIE TRANSACTIONS, 1990, 22 (01) :31-40