A Parallel Machine Scheduling Problem for a Plastic Injection Company
Loading...

Date
2021
Authors
Aytaç Ali Aslaner
Akdeniz Coşkun
Nur İlayda Tülemiş
Ece Özboyacı
Nil Ergün
Berk Bulut
Görkem Gülbent
Mert Paldrak
Efthimia Staiou
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science and Business Media Deutschland GmbH
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
In this study a production planning and scheduling problem is carried out in a company operating in the plastic injection sector in Turkey. The scheduling problem is classified as unrelated parallel machine scheduling problem with sequence dependent setup times including job-machine eligibility common source and precedence constraints. The proposed solution methodology is based on weekly planning with order grouping and makespan minimization. As a result a mixed integer programming model was formulated and optimal results are obtained for a sample data set with real data received. A user-friendly Decision Support System (DSS) was created to help the company with the weekly production planning and scheduling process applying a heuristic approach solution. © 2020 Elsevier B.V. All rights reserved.
Description
Keywords
Best-fit Algorithm, Common Molds, Heuristic Approach, Machine Eligibility, Parallel Machine Scheduling, Precedence Relations, Sequence-dependent Setup Times, Precedence Relations, Common Molds, Parallel Machine Scheduling, Best-Fit Algorithm, Sequence-Dependent Setup Times, Heuristic Approach, Machine Eligibility
Fields of Science
Citation
WoS Q
Scopus Q

OpenCitations Citation Count
2
Source
International Symposium for Production Research ISPR 2020
Volume
Issue
Start Page
790
End Page
803
Collections
PlumX Metrics
Citations
Scopus : 2
Captures
Mendeley Readers : 6
SCOPUS™ Citations
2
checked on Apr 09, 2026
Google Scholar™


