Due-date assignment and maintenance activity scheduling problem

被引：53
|
作者：
Mosheiov, Gur [1 ]
Oron, Daniel
机构：
[1] Hebrew Univ Jerusalem, Sch Business Adm, IL-91905 Jerusalem, Israel
[2] Hebrew Univ Jerusalem, Dept Stat, IL-91905 Jerusalem, Israel
[3] Univ Sydney, Sydney, NSW 2006, Australia
来源：
MATHEMATICAL AND COMPUTER MODELLING | 2006年 / 44卷 / 11-12期
关键词：
scheduling; single machine; due-date assignment; earliness-tardiness; rate modifying activity;
D O I：
10.1016/j.mcm.2006.03.008
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent factor. The objective is minimum total earliness, tardiness and due-date cost. We introduce a polynomial (O(n(4))) solution for the problem. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1053 / 1057
页数：5
相关论文
共 50 条
12345