A NEW PRODUCTION SCHEDULING MODULE USING PRIORITY-RULE BASED GENETIC ALGORITHM

被引:15
作者
Aydemir, E. [1 ]
Koruca, H., I [1 ]
机构
[1] Suleyman Demirel Univ, Fac Engn, Dept Ind Engn, TR-32260 Isparta, Turkey
关键词
Simulation; Scheduling; Priority Rules; Genetic Algorithm; Faborg-Sim; DYNAMIC JOB-SHOP; DISPATCHING RULES; TABU SEARCH; SIMULATION; MACHINE; TARDINESS; HYBRID; OPTIMIZATION; EARLINESS;
D O I
10.2507/IJSIMM14(3)7.299
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Production scheduling is an important function that determines the efficiency and productivity of a production system. Many optimization methods, techniques, tools, and heuristics have been used to solve production scheduling problems, accordingly priority rules are implemented for customers' orders in real-world applications. Simulations and heuristic methods are quite useful for making decisions, and they are used mostly to design and improve production systems by reducing their complexity. In this study, a Priority Rule-Based Genetic Algorithm Scheduling (PRGA-Sched) module was developed to provide shorter total completion time in production scheduling. The module was integrated with the Faborg-Sim simulation tool. As a case study, a heating boiler manufacturing system was analyzed and simulated with six products and customers' orders by using production data from the PRGA-Sched module in Faborg-Sim. The results showed that a shorter total completion time is obtained and saved than the initial situation by via PRGA-Sched module.
引用
收藏
页码:450 / 462
页数:13
相关论文
共 45 条
[31]   The development of a workforce management system for a hotline service [J].
Lin, CKY .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) :465-468
[32]   A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families [J].
Malve, Sujay ;
Uzsoy, Reha .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) :3016-3028
[33]   Simulation-based assessment of machine criticality measures for a shifting bottleneck scheduling approach in complex manufacturing systems [J].
Moench, Lars ;
Zimmermann, Jens .
COMPUTERS IN INDUSTRY, 2007, 58 (07) :644-655
[34]  
Pinedo M. L., 2016, Scheduling: Theory, Algorithms, and Systems, V5th
[35]   Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products [J].
Pongcharoen, P ;
Hicks, C ;
Braiden, PM ;
Stewardson, DJ .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 78 (03) :311-322
[36]   Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance [J].
Sadegheih, A .
APPLIED MATHEMATICAL MODELLING, 2006, 30 (02) :147-154
[37]   A computer simulation model for job shop scheduling problems minimizing makespan [J].
Tavakkoli-Moghaddam, R ;
Daneshmand-Mehr, M .
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (04) :811-823
[38]   Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems [J].
Tay, Joc Cing ;
Ho, Nhu Binh .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) :453-473
[39]   Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs [J].
Thiagarajan, S ;
Rajendran, C .
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 49 (04) :463-503
[40]   A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times [J].
Vallada, Eva ;
Ruiz, Ruben .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (03) :612-622