Open shop scheduling problem with a multi-skills resource constraint: a genetic algorithm and an ant colony optimisation approach

被引:31
作者
Ciro, Guillermo Campos [1 ,2 ]
Dugardin, Frederic [1 ]
Yalaoui, Farouk [1 ]
Kelly, Russell [2 ]
机构
[1] Univ Technol Troyes, CNRS, UMR6281, LOSI, Troyes, France
[2] Norelem SAS, Fontaine Les Gres, France
关键词
open shop scheduling; genetic algorithm; ant colony optimisation; flow time; resource constraints; skills; RELEASE DATES; SETUP; MACHINE; TIME;
D O I
10.1080/00207543.2015.1126371
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The continuous evolution of manufacturing environments leads to a more efficient production process that controls an increasing number of parameters. Production resources usually represent an important constraint in a manufacturing activity, specially talking about the management of human resources and their skills. In order to study the impact of this subject, this paper considers an open shop scheduling problem based on a mechanical production workshop to minimise the total flow time including a multi-skill resource constraint. Then, we count with a number of workers that have a versatility to carry out different tasks, and according to their assignment a schedule is generated. In that way, we have formulated the problem as a linear as and a non-linear mathematical model which applies the classic scheduling constraints, adding some different resources constraints related to personnel staff competences and their availability to execute one task. In addition, we introduce a genetic algorithm and an ant colony optimisation (ACO) method to solve large size problems. Finally, the best method (ACO) has been used to solve a real industrial case that is presented at the end.
引用
收藏
页码:4854 / 4881
页数:28
相关论文
共 60 条
[1]   SCHEDULING THE OPEN SHOP TO MINIMIZE MEAN FLOW TIME [J].
ACHUGBUE, JO ;
CHIN, FY .
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) :709-720
[2]   A job shop scheduling problem with human operators in handicraft production [J].
Agnetis, Alessandro ;
Murgia, Gianluca ;
Sbrilli, Simone .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (13) :3820-3831
[3]   A novel hybrid genetic algorithm for the open shop scheduling problem [J].
Ahmadizar, Fardin ;
Farahani, Mehdi Hosseinabadi .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 62 (5-8) :775-787
[4]   Scheduling part-time and mixed-skilled workers to maximize employee satisfaction [J].
Akbari, Mohammad ;
Zandieh, M. ;
Dorri, Behrouz .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (5-8) :1017-1027
[5]  
Anand E, 2015, INTELLIGENT INFORM M, V7, P33, DOI [DOI 10.4236/IIM.2015.71004, 10.4236/iim.2015.71004]
[6]   Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop [J].
Andresen, Michael ;
Braesel, Heidemarie ;
Moerig, Marc ;
Tusch, Jan ;
Werner, Frank ;
Willenius, Per .
MATHEMATICAL AND COMPUTER MODELLING, 2008, 48 (7-8) :1279-1293
[7]   Considering skills evolutions in multi-skilled workforce allocation with flexible working hours [J].
Attia, El-Awady ;
Duquenne, Philippe ;
Le-Lann, Jean-Marc .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (15) :4548-4573
[8]   Open shop scheduling problem to minimize makespan with release dates [J].
Bai, Danyu ;
Tang, Lixin .
APPLIED MATHEMATICAL MODELLING, 2013, 37 (04) :2008-2015
[9]  
Bellenguez O., 2005, PRACTICE THEORY AUTO
[10]   SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].
BELOUADAH, H ;
POSNER, ME ;
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) :213-231