An Algorithm for a Class of Three-Dimensional Assignment Problems Arising in Scheduling Applications
作者:
KennethC. Gilbert,
RuthBisgrove Hofstra,
期刊:
IIE Transactions
(Taylor Available online 1987)
卷期:
Volume 19,
issue 1
页码: 29-33
ISSN:0740-817X
年代: 1987
DOI:10.1080/07408178708975366
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
A scheduling problem often arising in trade shows and conventions is modeled as a planar three-dimensional assignment problem having a special cost structure. A polynomial-time algorithm for solving this case of the planar assignment problem is presented. The algorithm can also be used to solve heuristically a variation of the m-traveling salesman problem which arises as a secondary problem in the original scheduling application. Computational experience with data from a tourism industry convention scheduling problem is given.
点击下载:
PDF (209KB)
返 回