Accession Number:

AD0642278

Title:

SCHEDULING SEVERAL PRODUCTS ON ONE MACHINE TO MINIMIZE CHANGE-OVERS

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1966-10-01

Pagination or Media Count:

20.0

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.

Subject Categories:

  • Operations Research
  • Manufacturing and Industrial Engineering and Control of Production Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE