Single‐ and multiple‐processor models for minimizing completion time variance
作者:
Nicholas G. Hall,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1986)
卷期:
Volume 33,
issue 1
页码: 49-54
ISSN:0028-1441
年代: 1986
DOI:10.1002/nav.3800330105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThis article concerns the scheduling ofnjobs around a common due date, so as to minimize the average total earliness plus total lateness of the jobs. Optimality conditions for the problem are developed, based on its equivalence to an easy scheduling problem. It seems that this problem inherently has a huge number of optimal solutions and an algorithm is developed to find many of them. The model is extended to allow for the availability of multiple parallel processors and an efficient algorithm is developed for that problem. In this more general case also, the algorithm permits great flexibility in finding an optimal schedule.
点击下载:
PDF
(283KB)
返 回