Abstract

This paper considers the problem of scheduling a set of independent jobs on an arbitrary number of identical parallel machines with setup consideration and a makespan objective. The setup operations are performed by one available server. We propose two mixed integer programming (MIP) formulations to solve optimally this problem. The performance of each model is compared with another MIP proposed in the literature. It turns out that our formulation based on time-indexed variables outperforms the other models.

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.