100. Comparison of PNS and TCPNS formulations of production scheduling for furniture manufacturing
Invited abstract in session WF-4: P-graph Applications I., stream P-graph algorithms and applications.
Wednesday, 16:45 - 18:15Room: C105
Authors (first author is the speaker)
| 1. | Károly Kalauz
|
| Digital Development Center, Széchenyi István University | |
| 2. | Botond Bertok
|
| Széchenyi István University | |
| 3. | Marton Frits
|
| University of Pannonia |
Abstract
Effective production scheduling is crucial for optimizing productivity and meeting demand in the dynamic environment of production systems. This study investigates and compares Process Network Synthesis (PNS) and Time-Constrained Process Network Synthesis (TCPNS), to assess their performance in the context of mass production. Both proposed P-graph based modeling techniques handle complex and flexible recipes.
Precedence based resource scheduling model by TCPNS computes each schedule with any precision and handles complex changeover times but computation slows down due with the number of batches. Discrete Time Process Flow Modell by PNS may avoid very strict schedules due to time discretization but utilize combinatorial model reduction in the time horizon by algorithm MSG and computation is very fast regardless the huge model size. This comparative analysis highlights the strengths and considerations of each modeling approach, providing insights into their applicability and computational efficiency under varying real-life furniture manufacturing scenarios.
Keywords
- Optimization in industry, business and finance
- Complexity and efficiency of optimization algorithms
- Analysis and engineering of optimization algorithms
Status: accepted
Back to the list of papers