.png){kind=icon}
.png){kind=icon}
Return
Dynamic programming solution to the batching problem in just-in-time flow-shops
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2006.08.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mixed-model manufacturing systems are widely used by companies, in order to meet the customers' demand for a variety of products, in an efficient way. This paper is concerned with a special class of mixed-model manufacturing systems: flow-shops. In a flow-shop, each product has to be processed by a number of machines, following a common route. We study the production smoothing problem under presence of non-zero setup and processing times which also vary among the products. We split the master problem into two sub-problems which are concerned with determining the batch sizes and production sequences, respectively. We develop a dynamic programming procedure to solve the batching problem, and suggest using an existing method from the current literature to solve the sequencing problem. We conduct a computational study and show that our solution approach is effective in meeting the JIT goals and efficient in its computational requirements. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
just-in-time
production smoothing
flow shop
NP-hard
dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available