Bees Algorithm for multi-mode, resource-constrained project scheduling in molding industry

被引:24
|
作者
Oztemel, Ercan [1 ]
Selam, Ayse Aycim [1 ]
机构
[1] Univ Marmara, Dept Ind Engn, Istanbul, Turkey
关键词
Project scheduling; Bees Algorithm; Multi-mode resource utilization; Plastic injection molding; COLONY ALGORITHM; NAVIGATION PROCESS; GENETIC ALGORITHM; OPTIMIZATION; SEARCH;
D O I
10.1016/j.cie.2017.08.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In a resource-constrained environment project planning and scheduling becomes an extremely complex problem. For real life project schedules multi-mode resource requirements remarkably increase the complexity of and enlarge the respective solution spaces. Therefore schedulers require systematic methodologies compatible with the real world implementations in order to generate cost effective schedules. Similarly, plastic injection molding is known to be a "make-to order" process. The manufacturing of the mold which is a unique and essential component of plastic injection is considered kind of a project. The aim of this study is set to investigate the possibility of utilizing Bees Algorithm for single-resource, multi-mode, resource-constrained mold project scheduling in order to generate a systematic approach to solve the problems of this nature. A Bee-Based Mold Scheduling Model is therefore proposed and employed on a set of problems with different dimensions for the proof of concept. Detail description of an injection molding project together with respective performance analysis is also provided. After the implementation of the proposed methodology, it is well proven that, even for high number of activities and limited resources, the proposed method generates suitable schedules for the projects of this kind the implementation and respective modelling is explained and the results are discussed in detail within the text. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:187 / 196
页数:10
相关论文
共 50 条
  • [1] Memetic algorithm for multi-mode resource-constrained project scheduling problems
    Shixin Liu
    Di Chen
    Yifan Wang
    [J]. Journal of Systems Engineering and Electronics, 2014, 25 (04) : 609 - 617
  • [2] Memetic algorithm for multi-mode resource-constrained project scheduling problems
    Liu, Shixin
    Chen, Di
    Wang, Yifan
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2014, 25 (04) : 609 - 617
  • [3] Resource-constrained project scheduling: a heuristic for the multi-mode case
    Heilmann, R
    [J]. OR SPEKTRUM, 2001, 23 (03): : 335 - 357
  • [4] Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling
    Joanna Józefowska
    Marek Mika
    Rafał Różycki
    Grzegorz Waligóra
    Jan Węglarz
    [J]. Annals of Operations Research, 2001, 102 : 137 - 155
  • [5] Simulated annealing for multi-mode resource-constrained project scheduling
    Józefowska, J
    Mika, M
    Rózycki, R
    Waligóra, G
    Weglarz, J
    [J]. ANNALS OF OPERATIONS RESEARCH, 2001, 102 (1-4) : 137 - 155
  • [6] Modelling and Solving Multi-mode Resource-Constrained Project Scheduling
    Szeredi, Ria
    Schutt, Andreas
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, 2016, 9892 : 483 - 492
  • [7] Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling
    Tchao, Celso
    Martins, Simone L.
    [J]. LEARNING AND INTELLIGENT OPTIMIZATION, 2008, 5313 : 234 - +
  • [8] The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem
    Wauters, Tony
    Kinable, Joris
    Smet, Pieter
    Vancroonenburg, Wim
    Vanden Berghe, Greet
    Verstichel, Jannes
    [J]. JOURNAL OF SCHEDULING, 2016, 19 (03) : 271 - 283
  • [9] An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem
    Wang, Ling
    Fang, Chen
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 449 - 460
  • [10] A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem
    Fernandes Muritiba, Albert Einstein
    Rodrigues, Carlos Diego
    da Costa, Franciio Araujo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 92 : 145 - 154