Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Krisztián Attila Bakon, Tibor Holczinger
Format: Article
Language:English
Published: MDPI AG 2025-02-01
Series:Machines
Subjects:
flexible job shop problem
earliness/tardiness minimization
intermediate storage time
S-graph framework
production scheduling
linear programming
Online Access:https://www.mdpi.com/2075-1702/13/2/131
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2075-1702/13/2/131

Similar Items