Abstract
In inverse scheduling problems, ajob sequence is given and the objective is to determine the minimalperturbation to parameters, such as processing times or weights ofjobs so that the given schedule becomes optimal with respect to apre-selected objective function. In this paper we study thenecessary and sufficient conditions for optimality of the totalcompletion time problem on parallel machines and inverse schedulingproblem of the total completion time objective on parallel machinesin which the processing times are minimally adjusted, so that agiven target job sequence becomes an optimal schedule.
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 callMore From: Journal of Industrial & Management Optimization
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.
