ONn/l/F¯SETUP DEPENDENT PROBLEMS

Authors:
Publisher website
Google Scholar
Abstract
We consider sequencing n jobs which will arrive simultaneously at the start of the scheduling period and are to be processed on a single machine. The arrival and processing times of each job are assumed to be known and the time required to set up the machine for the next job is dependent upon the job that was immediately processed on the machine. A schedule is to be developed that minimizes the mean flow time and thus the cost of inventory. We propose a branch and bound algorithm for its solution and discuss our computational experience. We also examine the relative performance, in terms of costs, of this schedule over that resulting from the maximization of machine utilization on a large number of sets of jobs of varying sizes and tightness.

This publication has 1 reference indexed in Scilit: