Abstract
In this paper, a rescheduling problem to insert new jobs into original schedule is studied. First, this rescheduling problem is reduced to the NP-hard problem. Then the rescheduling problem is formulated as two mixed integer programming (MIP) formulations, and solved by using CPLEX. Further, the computational performance is showed and analysised for two proposed different MIP.
Sign-in/Register to access full text options 
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.
