A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs |
| |
Authors: | Susan K. Monkman Douglas J. Morrice Jonathan F. Bard |
| |
Affiliation: | 1. IROM Department, Red McCombs School of Business, The University of Texas at Austin, 1 University Station B6500, Austin, TX 78712-0212, United States;2. Graduate School of Business and Public Policy, Naval Postgraduate School, 555 Dyer Road, Monterey, CA 93943, United States;3. Graduate Program in Operations Research & Industrial Engineering, The University of Texas at Austin, 1 University Station C2200, Austin, TX 78712-0292, United States |
| |
Abstract: | In this paper, we develop a three-step heuristic to address a production scheduling problem at a high volume assemble-to-order electronics manufacturer. The heuristic provides a solution for scheduling multiple product families on parallel, identical production lines so as to minimize setup costs. The heuristic involves assignment, sequencing, and time scheduling steps, with an optimization approach developed for each step. For the most complex step, the sequencing step, we develop a greedy randomized adaptive search procedure (GRASP). We compare the setup costs resulting from the use of our scheduling heuristic against a heuristic previously developed and implemented at the electronics manufacturer that assumes approximately equal, sequence-independent, setup costs. By explicitly considering the sequence-dependent setup costs and applying GRASP, our empirical results show a reduction in setups costs for an entire factory of 14–21% with a range of single production line reductions from 0% to 49%. |
| |
Keywords: | Production scheduling Sequence-dependant setup costs Traveling salesman subtour problem GRASP Product families |
本文献已被 ScienceDirect 等数据库收录! |
|