期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 46, 期 22, 页码 6479-6498出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540701418960
关键词
scheduling; flow shop; due dates; greedy algorithm
资金
- University of Duisburg-Essen (Germany)
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of minimizing the total tardiness of jobs. To tackle this problem, it is suggested that a procedure based on a greedy algorithm is employed that successively iterates over an increasing number of candidate solutions. The computational experiments carried out show this algorithm outperforms the best existing one for the problem under consideration. In addition, out some tests are carried out to analyse the efficiency of the adopted design.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据