Title
Just-in-Time Smoothing Through Batching
Abstract
This paper presents two methods to solve the production smoothing problem in mixed-model just-in-time (JIT) systems with large setup and processing time variability between different models the systems produce. The problem is motivated by production planning at a leading U.S. automotive pressure hose manufacturer. One method finds all Pareto-optimal solutions that minimize total production rate variation of models and work in process (WIP), and maximize system utilization and responsiveness. These Pareto-optimal solutions are found efficiently in polynomial time with respect to total demand by an algorithm proposed in the paper. The other method relies on Daniel Webster's method of apportionment for production smoothing, which produces periodic, uniform, and reflective production sequences that can improve operations management of the JIT systems. Finally, the paper presents the results of a computational experiment with the two methods.
Year
DOI
Venue
2008
10.1287/msom.1070.0178
Manufacturing & Service Operations Management
Keywords
Field
DocType
total production rate variation,production planning,processing time variability,pareto-optimal solution,jit system,just-in-time smoothing,total demand,daniel webster,polynomial time,reflective production sequence,production smoothing,work in process,mixed model,optimization,operations management,computer experiment
Just-in-time manufacturing,Mathematical optimization,Economics,Work in process,Production planning,Smoothing,Time complexity,Periodic graph (geometry),Apportionment,Operations management,Automotive industry
Journal
Volume
Issue
ISSN
10
3
1523-4614
Citations 
PageRank 
References 
2
0.41
5
Authors
2
Name
Order
Citations
PageRank
Wieslaw Kubiak154062.61
Mesut Yavuz2213.63