The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

被引：0
|
作者：
Dvir Shabtay
George Steiner
机构：
[1] Ben-Gurion University of the Negev,Department of Industrial Engineering and Management
[2] McMaster University,Management Science and Information Systems Area, Michael G. DeGroote School of Business
来源：
Annals of Operations Research | 2008年 / 159卷
关键词：
Single-machine scheduling; Due date assignment; Controllable processing times; Resource allocation; Earliness-tardiness scheduling;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomial-time algorithm to find the optimal job sequence, due date values and resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and total resource consumption costs.
引用
收藏
页码：25 / 40
页数：15
相关论文
共 50 条
12345