Due-window assignment with identical jobs on parallel uniform machines

被引：15
|
作者：
Gerstl, Enrique [1 ]
Mosheiov, Gur [1 ]
机构：
[1] Hebrew Univ Jerusalem, Sch Business Adm, IL-91905 Jerusalem, Israel
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2013年 / 229卷 / 01期
关键词：
Scheduling; Parallel uniform machines; Earliness-tardiness; Assignment problem; Due-window; EARLINESS-TARDINESS; SCHEDULING PROBLEMS; COMMON; LOCATION; TIMES; SIZE;
D O I：
10.1016/j.ejor.2012.12.034
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：41 / 47
页数：7
相关论文
共 50 条
12345