SCHEDULING SEVERAL PRODUCTS ON ONE MACHINE TO MINIMIZE CHANGE-OVERS

Abstract

Given a finite horizon delivery schedule for n products one wishes to schedule production on a single machine to meet deliveries and minimize the number of change-overs of the machine from one product to another. A state space is defined and in it a network is constructed such that the shortest distance through the network corresponds to the minimum number of production change-overs. Certain properties of the optimal path are deduced from the dynamic programming formulation of the shortest route problem, and these properties are utilized in the construction of an algorithm that finds the optimal path. A numerical example illustrates the method.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1966
Accession Number
AD0642278

Entities

People

  • C. R. Glassey

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computer Programming
  • Construction
  • Contractors
  • Contracts
  • Dynamic Programming
  • Engineering
  • Governments
  • Heuristic Methods
  • Machines
  • Mathematical Programming
  • Operations Research
  • Production
  • Scheduling (Production)
  • United States Government
  • Universities

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers