An implicit enumeration algorithm for complex scheduling problems

Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use domina...

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 13; no. 1; pp. 25 - 40
Main Authors:	FLORIAN, M., TILQUIN, C., TILQUIN, G.
Format:	Journal Article
Language:	English
Published:	Taylor & Francis Group 01.01.1975
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!