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 条
12345