NobleBlocks
Public

An implicit enumeration algorithm for complex scheduling problems

Published in International Journal of Production Research • Jan 1, 1975
NobleIDNI7P21W22R81S26
Authors:
Michaël Florian
,
Charles Tilquin
,
G. TILQUIN

Abstract

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...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!