Heuristics for solving flow shop scheduling problem under resources constraints

被引:12
作者
Laribi, Imane [1 ]
Yalaoui, Farouk [2 ]
Belkaid, Faycal [1 ]
Sari, Zaki [3 ]
机构
[1] Univ Tlemcen, Mfg Engn Lab Tlemcen, BP N119, Tilimsen 13000, Algeria
[2] Univ Technol Troyes, UMR 6281, ICD LOSI, 12 Rue Marie Curie,Cs42060, F-10004 Troyes, France
[3] Izmir Univ Econ, Dept Ind Engn, TR-35330 Izmir, Turkey
关键词
Scheduling; flow shop; heuristics; no renewable resource; makespatt; FINANCIAL CONSTRAINTS; SEQUENCING PROBLEM;
D O I
10.1016/j.ifacol.2016.07.780
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Most of traditional scheduling problems deal with machine as the only resource however, other resources such as raw materials is often disregards. Considering the second resource makes scheduling problems more realistic and practical to implement in manufacturing industries. Due to the applicability of flow shop environment in different manufacturing, scheduling of these types of shops are extensively studied by several authors. However, introducing an additional resource in this environment is not well studied. The present work deals with makespan minimization in flow shop scheduling problems where no renewable resources constraints are considered. The paper illustrates the importance of Johnson (1954) algorithm for the two machine flow shop tinder resources constraints. A mathematical model is also presented. Then a well-know heuristic is adapted to propose fast solution for the m machines flow shop problem subject to resource constraint. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码:1478 / 1483
页数:6
相关论文
共 16 条
[1]   A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources [J].
Belkaid, Faycal ;
Sari, Zaki ;
Souier, Mehdi .
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2013, 4 (02) :17-30
[2]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[3]  
Carlier J., 1982, OPER RES LETT, V1, P2
[4]  
Carrera S., 2010, THESIS
[5]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[6]   Single machine scheduling problems with financial resource constraints: Some complexity results and properties [J].
Gafarov, Evgeny R. ;
Lazarev, Alexander A. ;
Werner, Frank .
MATHEMATICAL SOCIAL SCIENCES, 2011, 62 (01) :7-13
[7]   Basic scheduling problems with raw material constraints [J].
Grigoriev, A ;
Holthuijsen, M ;
de Klundert, JV .
NAVAL RESEARCH LOGISTICS, 2005, 52 (06) :527-535
[8]  
Johnson S. M., 1954, NAVAL RES LOGISTICS, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[9]  
Laribi I., 2014, INT C MET NAT INSP C
[10]  
Nawaz M., 1982, INT J MANAGEMENT SCI, V11, P91