A Problem in Single Facility Scheduling with Sequence Independent Changeover Costs

摘要

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)