Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
作者:
SzwarcWlodzimierz,
MukhopadhyaySamar K.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1995)
卷期:
Volume 46,
issue 6
页码: 753-761
ISSN:0160-5682
年代: 1995
DOI:10.1057/jors.1995.105
出版商: Taylor&Francis
关键词: Branch-and-Bound;Decomposition;Single-Machine Scheduling;Waiting Time
数据来源: Taylor
摘要:
AbstractThis paper deals with schedulingnjobs on a single machine in order to minimize the weighted sum of squared waiting times of the jobs. We present a powerful decomposition mechanism, based on a precedence relation concept, that easily handles problems of the sizen= 50 and 100 where the processing times and penalties are independently drawn from a uniform distribution. This mechanism is incorporated along with new branching rules in a branch-and-bound scheme that efficiently handles tough problems of the size 20 and 50.
点击下载:
PDF (3657KB)
返 回