N job
Subtitle: one machine scheduling to minimize the number of late jobs when set-up times are sequence dependent
By: by S. Balut and G. Howard
Contributors: Howard, Gilbert Thoreau, 1941-; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1972
Place of publication: Monterey, Calif
Language: eng
Number of pages: 19
Subjects: Production scheduling
Description: Two algorithms have been formulated for scheduling n jobs through a single facility to minimize the number of late jobs when set-up times are sequence dependent. The first is a simple matrix algorithm which solves the problem when jobs must be processes in first-come, first-served (FCFS) order. The second is a branch and bound technique which arrives at an optimal solution with no restrictions on the sequence used. Both algorithms are demonstrated by examples. (Author)
Notes: Title from cover.

"February 1972"--Cover.

"NPS-55HK72021A"--Cover.

Author(s) subject terms: Scheduling, set up time, job shop scheduling.

Includes bibliographical references (p. 14).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1972.

AD747063.