A Problem in Single Facility Scheduling with Sequence Independent Changeover Costs.

Abstract

The paper treats a problem of optimally scheduling a number of products on a single facility when changeover costs are sequence independent. After some observations, a rather cumbersome, but straightforward, initial formulation is transformed into a zero-one knapsack problem with side constraints, for which an existing algorithm is modified to provide an efficient solution procedure. A numerical example and computational results are included. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 18, 1972
Accession Number
AD0755223

Entities

People

  • Adel A. Aly
  • Henry L. W. Nuttle

Organizations

  • North Carolina State University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Buildings And Structures
  • Mathematics
  • Observation
  • Observatories
  • Research Facilities
  • Scheduling (Production)
  • Sequences

Readers

  • Operations Research