Jeffrey W. Herrmann
Department of Mechanical Engineering and Institute for Systems Research
University of Maryland
Copyright Notice: This paper is a preprint of a paper accepted for the 2003 Industrial Engineering Research Conference, Portland, Oregon, May 18-20, 2003. Personal use of this material is permitted. However, permission to reprint or republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists or to reuse any copyrighted component of this work in other works must be obtained from the copyright holder.
A cyclic production system manufactures a set of products at a constant frequency. Each resource repeatedly performs a certain set of tasks, and the system produces a certain set of units each cycle. The production schedule defines the timing of the tasks within each cycle, which determines system performance on measures such as throughput and work-in-process inventory. This paper describes the tradeoffs that occur when scheduling such systems. This paper presents a problem space search algorithm that explores the tradeoffs between throughput and inventory.
Download: Click on the following link to download the paper. The file is in PDF format.
Last updated by Jeffrey W. Herrmann, March 26, 2003.
Return to Jeffrey W. Herrmann | University of Maryland | Department of Mechanical Engineering | Institute for Systems Research | Computer Integrated Manufacturing Lab .