Journal article
Minimizing the total waiting time of intermediate products in a manufacturing process
International transactions in operational research, Vol.26(3), pp.1096-1117
05/2019
DOI: 10.1111/itor.12343
Abstract
A mixed model production plan may use a schedule that will consecutively produce a small batch of each product model on a production line. However, it may be necessary to deviate from this schedule and produce the models in larger batches at a manufacturing cell in the production line if the manufacturing cell cannot support many setups. A potential problem with large batches is that products that are produced early must wait for its turn at the next step of the production process. When additional operations are performed on products that wait in order to restore its quality, it is imperative to schedule production such that the total time products wait is minimized. We model the problem as scheduling jobs on a single machine with setups and deadlines such that the total waiting time is minimized. We develop a tabu search based heuristic and branch‐and‐bound algorithm to solve the model. Results show that the heuristic solution to 30‐product–3‐product model problems is within 3% of its optimal solution.
Details
- Title: Subtitle
- Minimizing the total waiting time of intermediate products in a manufacturing process
- Creators
- Renato de Matta - University of Iowa
- Resource Type
- Journal article
- Publication Details
- International transactions in operational research, Vol.26(3), pp.1096-1117
- DOI
- 10.1111/itor.12343
- ISSN
- 0969-6016
- eISSN
- 1475-3995
- Number of pages
- 22
- Grant note
- Lary and Lori Wright Research Fellowship
- Language
- English
- Date published
- 05/2019
- Academic Unit
- Business Analytics
- Record Identifier
- 9984083217302771
Metrics
9 Record Views