A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop

被引：10
|
作者：
Nagano M.S. [1 ]
Rossi F.L. [1 ]
Tomazella C.P. [1 ]
机构：
[1] Production Engineering Department, São Carlos School of Engineering, University of São Paulo, Av. Trabalhador Sãocarlense, 400, Centro, São Carlos, 13566-590, SP
来源：
Production Engineering | 2017年 / 11卷 / 4-5期
关键词：
Heuristic methods; No-idle flow shop; Scheduling; Total tardiness;
D O I：
10.1007/s11740-017-0747-2
中图分类号：
学科分类号：
摘要：
This paper aims at minimizing total tardiness in a no-idle permutational flow shop environment. Even though this criterion is relevant for improving client satisfaction in production systems with strict due dates, no constructive heuristics have been developed for this specific problem so far. In this study, high performance constructive heuristics from related problems were adapted and compared to a new one proposed for the problem Fm|no- idle, prmu| ∑ T. Computational experiments show that the new method significantly outperforms the adapted existing heuristics. © 2017, German Academic Society for Production Engineering (WGP).
引用
收藏
页码：523 / 529
页数：6
相关论文
共 50 条
  • [1] A heuristic for minimizing the makespan in no-idle permutation flow shops
    Kalczynski, PJ
    Kamburowski, J
    COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 49 (01) : 146 - 154
  • [2] A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion
    Shen, Jing-nan
    Wang, Ling
    Wang, Sheng-yao
    KNOWLEDGE-BASED SYSTEMS, 2015, 74 : 167 - 175
  • [3] Permutation, no-wait, no-idle flow shop problems
    Makuchowski, Mariusz
    ARCHIVES OF CONTROL SCIENCES, 2015, 25 (02): : 189 - 199
  • [4] MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem
    Balogh, Andrea
    Garraffa, Michele
    O'Sullivan, Barry
    Salassa, Fabio
    COMPUTERS & OPERATIONS RESEARCH, 2022, 146
  • [5] A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
    Riahi, Vahid
    Chiong, Raymond
    Zhang, Yuli
    COMPUTERS & OPERATIONS RESEARCH, 2020, 117
  • [6] Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
    Saber, Reza Ghorbani
    Ranjbar, Mohammad
    COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [7] Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP
    M'Hallah, R.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 75 : 142 - 156
  • [8] A new heuristic for minimizing total completion time objective in permutation flow shop scheduling
    Laha, Dipak
    Chakravorty, Arindam
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (9-12): : 1189 - 1197
  • [9] Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem
    Liu, Guo-Sheng
    Li, Jin-Jin
    Tang, Ying-Si
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (06)
  • [10] A new heuristic for minimizing total completion time objective in permutation flow shop scheduling
    Dipak Laha
    Arindam Chakravorty
    The International Journal of Advanced Manufacturing Technology, 2011, 53 : 1189 - 1197
12345