A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
作者:
AlidaeeBahram,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1990)
卷期:
Volume 41,
issue 11
页码: 1065-1068
ISSN:0160-5682
年代: 1990
DOI:10.1057/jors.1990.165
出版商: Taylor&Francis
关键词: heuristics;single-machine scheduling
数据来源: Taylor
摘要:
AbstractWe consider the static single-facility scheduling problem where the processing times of jobs are a nondecreasing and differentiable function of their starting (waiting) times and the objective is to minimize the total elapsed time (makespan) in which all jobs complete their processing. We give a criterion for optimality of two jobs to be scheduled next to each other, and based on this criterion we propose a heuristic algorithm to solve the problem. The effectiveness of the algorithm is empirically evaluated for quadratic and exponential cost functions. In the quadratic case it is compared with the static heuristic algorithm proposed by Gupta and Gupta.
点击下载:
PDF (1630KB)
返 回