Two new methods for improving the branch and bound algorithm for the single machine scheduling problem

Author: Cahill, Daniel Patrick
Published: [Place of publication not identified] : [publisher not identified], 1992.
Physical Description: 95 leaves

Finding items...

Graduate Program

Dissertation Note

M.S. Pennsylvania State University.

Reproduction Note

Library holds archival microfiche negative and service copy, (Micrographics International, 1992).

View MARC record | catkey: 1774002

Actions for Two new methods for improving the branch and bound algorithm for the single machine scheduling problem