Production Planning for Parallel Machine Working System using Makespan Determination

被引:0
|
作者
Aromstian, D. [1 ]
Homrossukon, S. [1 ]
机构
[1] Thammasat Univ, Dept Ind Engn, Klongluang 12120, Pathum Thani, Thailand
关键词
Production Planning; Makespan; Parallel Machine; Production Efficiency; SCHEDULING JOBS; DATES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work developed the method used to plan the production for parallel machines, aiming to achieve the maximum working efficiency condition. There are two types of machines, regular and special. The same type of machine might work independently and/or dependently depending on the processes required but for the different type, machine will work dependently. The model based on the determination of machine makespan was applied in order to assign the works providing the maximum daily working time or the minimum idle time of each machine. The constrained conditions were determined, based on the nature of the production of interest. The developed method could establish the efficient plan according to the former study and provide the working efficiency being higher than 90%, comparing to original plan having efficiency only 60-70%.
引用
收藏
页码:1774 / 1778
页数:5
相关论文
共 50 条
  • [21] Makespan minimization for two parallel machines with an unavailable period on each machine
    Lin, Chien-Hung
    Liao, Ching-Jong
    International Journal of Advanced Manufacturing Technology, 2007, 33 (9-10): : 1024 - 1030
  • [22] Makespan minimization for two parallel machines with an unavailable period on each machine
    Chien-Hung Lin
    Ching-Jong Liao
    The International Journal of Advanced Manufacturing Technology, 2007, 33 : 1024 - 1030
  • [23] Parallel machine scheduling for minimizing the makespan and the average flow-time
    Ruiz-Torres, AJ
    Enscore, EE
    Barton, RR
    6TH INDUSTRIAL ENGINEERING RESEARCH CONFERENCE PROCEEDINGS: (IERC), 1997, : 186 - 191
  • [24] Makespan minimization for two parallel machines with an unavailable period on each machine
    Lin, Chien-Hung
    Liao, Ching-Jong
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 33 (9-10): : 1024 - 1030
  • [25] Minimizing makespan on parallel machines with release time and machine eligibility restrictions
    Centeno, G
    Armacost, RL
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (06) : 1243 - 1256
  • [26] Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
    Ruiz-Torres, Alex J.
    Paletta, Giuseppe
    Perez, Eduardo
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2051 - 2061
  • [27] Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
    Hu, Xiaofeng
    Bao, Jin-Song
    Jin, Ye
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (06) : 1639 - 1651
  • [28] Preemptive Parallel-Machine Scheduling with a Common Server to Minimize Makespan
    Cheng, T. C. E.
    Kravchenko, Svetlana A.
    Lin, Bertrand M. T.
    NAVAL RESEARCH LOGISTICS, 2017, 64 (05) : 388 - 398
  • [29] Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling
    Bamatraf, Khaled
    Gharbi, Anis
    SYSTEMS, 2024, 12 (06):
  • [30] Identical parallel machine scheduling problem for minimizing the makespan using genetic algorithm combined by simulated annealing
    Liu, M.
    Wu, Ch.
    Chinese Journal of Electronics, 1998, 7 (04): : 317 - 321