Abstract

This article addresses the problem of dynamic job scheduling on a single machine with Poisson arrivals, stochastic processing times and due dates, in the presence of sequence-dependent setups. The objectives of minimizing mean earliness and mean tardiness are considered. Two approaches for dynamic scheduling are proposed, a Reinforcement Learning-based and one based on Fuzzy Logic and multi-objective evolutionary optimization. The performance of the two scheduling approaches is tested against the performance of 15 dispatching rules in four simulation scenarios with different workload and due date pressure conditions. The scheduling methods are compared in terms of Pareto optimal-oriented metrics, as well as in terms of minimizing mean earliness and mean tardiness independently. The experimental results demonstrate the merits of the proposed methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.