Mathematical Programming Solution of a Hoist Scheduling Program

Abstract
This paper describes a mixed integer programming model of a process during which electronic circuit boards are chemically treated in a sequence of tanks. The boards must remain in these tanks for periods of time lying within specified bounds. A hoist mechanism is to be programmed to place boards into tanks, remove boards from tanks, and transport boards between tanks, so as to maximize the throughput of the system. Computational experience and a detailed example are given.

This publication has 0 references indexed in Scilit: