N Job, One Machine Scheduling to Minimize the Number of Late Jobs when Set-Up Times are Sequence Dependent.

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)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1972
Accession Number
AD0747063

Entities

People

  • Gilbert T. Howard
  • Stephen J. Balut

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Buildings And Structures
  • Mathematics
  • Scheduling (Production)
  • Sequences

Readers

  • Calculus or Mathematical Analysis
  • Parallel and Distributed Computing.
  • Software Engineering