N Job, One Machine Scheduling to Minimize the Number of Late Jobs when Set-Up Times are Sequence Dependent.
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Pagination or Media Count:
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
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems