An Improved Lower Bound for the Changeover Scheduling Problem

Abstract

In a multi-product, discrete-item manufacturing environment, it is often more economical to produce several products on one flexible machine than to have a dedicated machine for each product. In this paper, we consider the changeover scheduling problem (CSP). The CSP minimizes the cost consequences of changing over limited-capacity resources when two or more products are produced on them. We consider scheduling multiple products on a single machine where demand is dynamic, deterministic, and is to be met without backlogging. We develop analytical results for a lower bound on this problem and give computational results using this lower bound in a branch-and-bound algorithm.

Additional information

Notes on contributors

James D. Blocher

James Blocher is an Assistant Professor of Operations Management at the Indiana University School of Business. His primary teaching responsibility is the MBA core Production and Operations Management course. Other teaching duties include undergraduate honors, MBA electives, and Ph.D. seminars. His research interests in scheduling, purchasing, and strategy are derived primarily from his manufacturing experience with General Motors. He has published articles in Naval Research Logistics, The Academy of Management Journal, IIE Transactions, and European Journal of Operational Research.

Suresh Chand

Suresh Chand is a Professor of Management at the Krannert School of Management, Purdue University. He joined Purdue University in 1979 after completing his Ph.D. in Industrial Administration at Carnegie-Mellon University. He teaches Production and Operations Management core courses at the undergraduate and the MBA levels, MBA electives on technology management, TQM, and production planning and control, and Ph.D. seminars. His research interests include scheduling and production/inventory planning. He has published regularly in a number of leading journals. He is an Associate Editor for Management Science, an Associate Editor for INFOR and an Area Editor for Production and Operations Management.