Abstract

Production rescheduling is one of the most challenging problems in production management, in which some parameters, such as customer demand and job processing time, are subject to uncertainty during the planning horizon. This paper develops a scheduling and rescheduling method for the simultaneous lot-sizing and job shop scheduling problem, considering sequence-dependent setup times and capacity constraints. The objective is to find a trade-off between safety levels and production costs focusing on schedulability and optimality as the two most important performance indicators in the face of uncertainty. Therefore, a new adjustable formulation based on satisfiability modulo theories has been developed to tackle the demand and processing time uncertainty. Then, a combination of neural networks and a K-means based heuristic was applied to calibrate the model by determining the profitable value of the safety levels as a strategy to increase the robustness of the schedule. We also developed a Monte Carlo simulation to assess the performance of the proposed algorithm and compare it with other approaches addressed in the literature. The computational results show that the proposed algorithm is efficient and promising in protecting the schedulability of the model, taking the optimality criterion into account.

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.