Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework
This paper addresses the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimizing both earliness/tardiness (E/T) and intermediate storage time (IST). An extended S-graph framework that incorporates E/T and IST minimization while maintaining the structural advantages of the origin...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Machines |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1702/13/2/131 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849718634829578240 |
|---|---|
| author | Krisztián Attila Bakon Tibor Holczinger |
| author_facet | Krisztián Attila Bakon Tibor Holczinger |
| author_sort | Krisztián Attila Bakon |
| collection | DOAJ |
| description | This paper addresses the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimizing both earliness/tardiness (E/T) and intermediate storage time (IST). An extended S-graph framework that incorporates E/T and IST minimization while maintaining the structural advantages of the original S-graph approach is presented. The framework is further enhanced by integrating linear programming (LP) techniques to adjust machine assignments and operation timings dynamically. The following four methodological approaches are systematically analyzed: a standalone S-graph for E/T minimization, an S-graph for combined E/T and IST minimization, a hybrid S-graph with LP for E/T minimization, and a comprehensive hybrid approach addressing both E/T and IST. Computational experiments on benchmark problems demonstrate the efficacy of the proposed methods, with the standalone S-graph showing efficiency for smaller instances and the hybrid approaches offering improved solution quality for more complex scenarios. The research provides insights into the trade-offs between computational time and solution quality across different problem configurations and storage policies. This work contributes to the field of production scheduling by offering a versatile framework capable of addressing the multi-objective nature of modern manufacturing environments. |
| format | Article |
| id | doaj-art-ac8751dde3ad44ae8be3c480999fa6a8 |
| institution | DOAJ |
| issn | 2075-1702 |
| language | English |
| publishDate | 2025-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Machines |
| spelling | doaj-art-ac8751dde3ad44ae8be3c480999fa6a82025-08-20T03:12:19ZengMDPI AGMachines2075-17022025-02-0113213110.3390/machines13020131Addressing Due Date and Storage Restrictions in the S-Graph Scheduling FrameworkKrisztián Attila Bakon0Tibor Holczinger1Department of Applied Informatics, Faculty of Information Technology, University Center for Circular Economy Nagykanizsa, University of Pannonia, Zrinyi u. 18., 8800 Nagykanizsa, HungaryDepartment of Applied Informatics, Faculty of Information Technology, University Center for Circular Economy Nagykanizsa, University of Pannonia, Zrinyi u. 18., 8800 Nagykanizsa, HungaryThis paper addresses the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimizing both earliness/tardiness (E/T) and intermediate storage time (IST). An extended S-graph framework that incorporates E/T and IST minimization while maintaining the structural advantages of the original S-graph approach is presented. The framework is further enhanced by integrating linear programming (LP) techniques to adjust machine assignments and operation timings dynamically. The following four methodological approaches are systematically analyzed: a standalone S-graph for E/T minimization, an S-graph for combined E/T and IST minimization, a hybrid S-graph with LP for E/T minimization, and a comprehensive hybrid approach addressing both E/T and IST. Computational experiments on benchmark problems demonstrate the efficacy of the proposed methods, with the standalone S-graph showing efficiency for smaller instances and the hybrid approaches offering improved solution quality for more complex scenarios. The research provides insights into the trade-offs between computational time and solution quality across different problem configurations and storage policies. This work contributes to the field of production scheduling by offering a versatile framework capable of addressing the multi-objective nature of modern manufacturing environments.https://www.mdpi.com/2075-1702/13/2/131flexible job shop problemearliness/tardiness minimizationintermediate storage timeS-graph frameworkproduction schedulinglinear programming |
| spellingShingle | Krisztián Attila Bakon Tibor Holczinger Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework Machines flexible job shop problem earliness/tardiness minimization intermediate storage time S-graph framework production scheduling linear programming |
| title | Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework |
| title_full | Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework |
| title_fullStr | Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework |
| title_full_unstemmed | Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework |
| title_short | Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework |
| title_sort | addressing due date and storage restrictions in the s graph scheduling framework |
| topic | flexible job shop problem earliness/tardiness minimization intermediate storage time S-graph framework production scheduling linear programming |
| url | https://www.mdpi.com/2075-1702/13/2/131 |
| work_keys_str_mv | AT krisztianattilabakon addressingduedateandstoragerestrictionsinthesgraphschedulingframework AT tiborholczinger addressingduedateandstoragerestrictionsinthesgraphschedulingframework |