Accession Number : AD0747063
Title : N Job, One Machine Scheduling to Minimize the Number of Late Jobs when Set-Up Times are Sequence Dependent.
Descriptive Note : Technical rept.,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Personal Author(s) : Howard,Gilbert T. ; Balut,Stephen J.
Report Date : FEB 1972
Pagination or Media Count : 19
Abstract : 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)
Descriptors : (*SCHEDULING, ALGORITHMS), (*MACHINE SHOP PRACTICE, SCHEDULING), MATRICES(MATHEMATICS), SET THEORY, OPTIMIZATION
Subject Categories : Operations Research
Mfg & Industrial Eng & Control of Product Sys
Distribution Statement : APPROVED FOR PUBLIC RELEASE