期刊
COMPUTERS & OPERATIONS RESEARCH
卷 47, 期 -, 页码 106-113出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2014.02.004
关键词
Scheduling; Earliness; Tardiness; Maintenance; Due date
类别
资金
- International Campus on Safety and Intermodality in Transportation (CISIT)
- Nord-Pas-de-Calais Region (France)
- European Community
- Regional Delegation for Research and Technology (France)
- French Ministry of Higher Education and Research
- National Center for Scientific Research (CNRS, France)
We consider the problem of scheduling a set of jobs on a single machine against a common and restrictive due date. In particular, we are interested in the problem of minimizing the weighted sum of maximum earliness and maximum tardiness costs. This kind of objective function is related to the just-in-time environment where penalties, such as storage cost and additional charges for late delivery, should be avoided. First we present a mixed integer linear model for the problem without availability constraints and we prove that this model can be reduced to a polynomial-time model. Secondly, we suppose that the machine undergoes a periodic preventive maintenance. We present then a second mixed integer linear model to solve the problem to optimality. Although the latter problem can be solved to optimality for small instances, we show that the problem reduces to the one-dimensional bin packing problem. Computational results show that the proposed algorithm best fit decreasing performs well. (C) 2014 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据