Abstract
Scheduling problems with sequence-dependent setup times in industries currently attract the attention of researchers and practitioners. This study aims to develop a mathematical model for optimizing a single-machine environment with such times using an analogy with the traveling salesman problem. Employing a technological and modern modeling language for its computational implementations, firstly, five main formulations of this problem in the literature are evaluated and the best one for addressing the proposed problem is identified. Secondly, an arc-flow completion time and precedence model for a single-machine scheduling problem is assessed. Finally, the proposed model is improved by passing the initial solutions obtained by two heuristics to it. As a result, the mathematical model developed returns lower computational times than state-of-the-art ones (even without improvements to the initial solution) which indicates the success of using an analogy between formulations of the traveling salesman problem and the proposed model.
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 callDisclaimer: 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.
