Minimizing flowtime and maximum earliness on a single machine
作者:
MURAT KOKSALAN,
MERAL AZIZOGLU,
SUNAKOKSALAN KONDAKCI,
期刊:
IIE Transactions
(Taylor Available online 1998)
卷期:
Volume 30,
issue 2
页码: 192-200
ISSN:0740-817X
年代: 1998
DOI:10.1080/07408179808966450
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
We consider the bicriteria scheduling problem of minimizing flowtime and maximum earliness on a single machine. The problem is known to be NP-hard. We develop heuristic procedures for generating all efficient sequences for the cases where machine idle time is either allowed or not allowed. For both cases we also discuss an algorithm that finds the best of the approximately efficient sequences for a given objective function by generating only a small subset of those sequences. We present computational results which demonstrate that the heuristic procedures and the algorithms perform very well.
点击下载:
PDF (1030KB)
返 回