Economic lot scheduling problem with sequence-dependent setup costs

Multiple products are scheduled in a cyclical fashion on a single facility; for the sequence-dependent case, the use of the travelling salesman algorithm to determine the optimum sequence has been suggested often but not checked out. This article illustrates with an application that substantial reductions in inventory carrying cost and setup cost can be achieved by exploiting the sequence dependencies of the setup costs.