A multistage flow shop scheduling problem with parallel machines: A Simulated Annealing approach

Production scheduling is a critical aspect of the production stage that have a tremendous effect on the long-term success of any business involve in manufacturing. It helps to make sure that the company maximize their profit and meet customer satisfaction by minimizing the cost and production time, ensuring efficient materials usage as well as reduce delays and interruptions. This article examines a case study in a fabric manufacturing company that is facing with an orders fulfillment problem. By formulating a mathematical model that addresses the practical production scenario, we consider a multistage flowshop scheduling problem with parallel machine at each stage. The objective is to minimize the total tardines of the orders produced. The simulated annealing (SA) technique is suggested as a solution to the problem at hand, ensuring a practical execution duration. The algorithm generates a Gantt chart detailing the allocation of orders to machines. Finally, the optimized solution is benchmarked against the company's historical data for result validation.

Authors

Institutions

Publication Details

Published
2024-12-01
DOI
https://doi.org/10.1109/iclie61478.2024.11015400
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A multistage flow shop scheduling problem with parallel machines: A Simulated Annealing approach

Le Duc Dao, Pham Cong Nghi
Scheduling and Optimization Algorithms
article

A multistage flow shop scheduling problem with parallel machines: A Simulated Annealing approach

Le Duc Dao, Pham Cong Nghi
article en

Abstract

Production scheduling is a critical aspect of the production stage that have a tremendous effect on the long-term success of any business involve in manufacturing. It helps to make sure that the company maximize their profit and meet customer satisfaction by minimizing the cost and production time, ensuring efficient materials usage as well as reduce delays and interruptions. This article examines a case study in a fabric manufacturing company that is facing with an orders fulfillment problem. By formulating a mathematical model that addresses the practical production scenario, we consider a multistage flowshop scheduling problem with parallel machine at each stage. The objective is to minimize the total tardines of the orders produced. The simulated annealing (SA) technique is suggested as a solution to the problem at hand, ensuring a practical execution duration. The algorithm generates a Gantt chart detailing the allocation of orders to machines. Finally, the optimized solution is benchmarked against the company's historical data for result validation.

Ho Chi Minh City University of Technology (VN)
Openalex Percentile: Top 56%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A multistage flow shop scheduling problem with parallel machines: A Simulated Annealing approach — Le Duc Dao, Pham Cong Nghi · (2024) | TGRS Research Map | TGRS