Unrelated parallel machine scheduling with dedicated machines and common deadline

被引:12
|
作者
Lee, Cheng-Hsiung [1 ]
Liao, Ching-Jong [2 ]
Chao, Chien-Wen [2 ]
机构
[1] Chihlee Inst Technol, Dept Int Trade, New Taipei City 220, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
关键词
Scheduling; Unrelated parallel machines; Heuristic; Dedicated machines; Common deadline; SETUP TIMES;
D O I
10.1016/j.cie.2014.05.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper addresses a scheduling problem in the manufacturing of Polyvinyl Chloride pipes. There are two main attributes of PVC pipes: diameter and color. Each attribute has a corresponding attribute setup time and usually has several different levels. Each extruder produces different PVC pipe products based on the diameters as large, middle and small. The alternatives exist between these extruders, where the large and the middle type extruders can be used to produce the PVC pipes with the other diameters; the small type extruders can be used to produce the PVC pipes with middle diameters but cannot produce those with large diameters. The processing times are longer in all of the alternatives among different types of extruders. The objective is to minimize the total completion time for the unrelated parallel machine problem. Three dedicated machine heuristics are proposed herein for the problem and have been evaluated by comparing with the current scheduling method used in the case plant. The computational results show that the proposed constructive heuristics outperform the current scheduling method with significant improvements and can be used to solve large-size problems in reasonable computational times. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:161 / 168
页数:8
相关论文
共 50 条
  • [31] Unrelated parallel machine scheduling with machine processing cost
    Safarzadeha, Hamid
    Niakia, Seyed Taghi Akhavan
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, : 33 - 48
  • [32] On the complexity of scheduling unrelated parallel machines with limited preemptions
    Lenstra, Jan Karel
    Vakhania, Nodari
    OPERATIONS RESEARCH LETTERS, 2023, 51 (02) : 187 - 189
  • [33] Scheduling tasks with exponential duration on unrelated parallel machines
    Nouri, Mostafa
    Ghodsi, Mohammad
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (16-17) : 2462 - 2473
  • [34] Scheduling of unrelated parallel machines: an application to PWB manufacturing
    Yu, L
    Shih, HM
    Pfund, M
    Carlyle, WM
    Fowler, JW
    IIE TRANSACTIONS, 2002, 34 (11) : 921 - 931
  • [35] Optimal scheduling on unrelated parallel machines with combinatorial auction
    Yan, Xue
    Wang, Ting
    Shi, Xuefei
    ANNALS OF OPERATIONS RESEARCH, 2025, 344 (2-3) : 937 - 963
  • [36] Improved approximation schemes for scheduling unrelated parallel machines
    Jansen, K
    Porkolab, L
    MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (02) : 324 - 338
  • [37] Complexity of preemptive minsum scheduling on unrelated parallel machines
    Sitters, R
    JOURNAL OF ALGORITHMS, 2005, 57 (01) : 37 - 48
  • [38] SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS
    Jiang, Yiwei
    Zhou, Ping
    Wang, Huijuan
    Hu, Jueliang
    ANZIAM JOURNAL, 2017, 58 (3-4): : 314 - 323
  • [39] Parallel dedicated machines scheduling with chain precedence constraints
    Agnetis, Alessandro
    Kellerer, Hans
    Nicosia, Gaia
    Pacifici, Andrea
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 221 (02) : 296 - 305
  • [40] Parallel machine scheduling with preference of machines
    Chuang, Ming-Chou
    Liao, Ching-Jong
    Chao, Chien-Wen
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (14) : 4139 - 4152