flexible job scheduling under consideration of time and energy consumption using enhanced iterative deferred acceptance algorithm

This paper highlights the shift in the industrial sector towards a decentralized structure, focusing the importance of energy efficiency for manufacturers and the need for quick job completion to satisfy customers. the study proposes a matching game approach using the job scheduling problem (jsp) to address both manufacturer and customer concerns. it introduces the deferred acceptance (da) algorithm to create stable and optimal matches between machines and operations, incorporating the w-value concept to represent willingness values between partners. the enhanced iterative da (eida) algorithm, enhanced with the w-value, shows improved job completion time, reduced energy consumption, and faster runtime compared to the genetic algorithm. through experiments, our enhanced iterative da (eida) algorithm results in an average 6.40% increase in job completion time and a 16.60% reduction in manufacturers’ energy consumption compared to the genetic algorithm. moreover, utilizing the w-value leads to a 19.03% average runtime improvement.