2021
DOI: 10.3390/pr9071255
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Mixed Model Lotsizing and Scheduling for Flexible Machining Lines Using a Constructive Heuristic

Abstract: Dynamic lotsizing and scheduling on multiple lines to meet the customer due dates is significant in multi-line production environments. Therefore, this study investigates dynamic lotsizing and scheduling problems in multiple flexible machining lines considering mixed products. In addition, uncertainty in demand and machine failure is considered. A mathematical model is proposed for the considered problem with an aim to maximize the probability of completion of product models from different customer orders. A c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 32 publications
(74 reference statements)
0
1
0
Order By: Relevance
“…They proposed six constructive heuristics and an iterated greedy algorithm to minimize the makespan. Yue et al [26] addressed the dynamic lot-sizing and scheduling problem in flexible multi-product facilities by employing a mathematical model and a constructive heuristic method to maximize profit, considering demand uncertainty and machine failure. Ghasemkhani et al [27] solved the integrated production-inventory-routing problem by employing an MILP model and two heuristic algorithms for a real-life case study.…”
Section: Introductionmentioning
confidence: 99%
“…They proposed six constructive heuristics and an iterated greedy algorithm to minimize the makespan. Yue et al [26] addressed the dynamic lot-sizing and scheduling problem in flexible multi-product facilities by employing a mathematical model and a constructive heuristic method to maximize profit, considering demand uncertainty and machine failure. Ghasemkhani et al [27] solved the integrated production-inventory-routing problem by employing an MILP model and two heuristic algorithms for a real-life case study.…”
Section: Introductionmentioning
confidence: 99%