期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 119, 期 -, 页码 146-156出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.03.036
关键词
Scheduling; Sequencing; Heuristics; Integer programming
Scheduling jobs on a set of identical parallel machines using efficient heuristics when the objective is to minimize total weighted squared tardiness is considered. Two efficient heuristics and an improvement procedure are presented for the problem. These heuristics and other heuristics are tested using problem sets that represent a variety of conditions. The results show that one of the heuristics consistently performs better than the other heuristics tested. It is also shown how these heuristics can be incorporated into other procedures such as the existing Lagrangian relaxation procedure or meta-heuristics to obtain improved solutions for medium sized problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据