Abstract
We consider a natural, yet challenging variant of the parallel machine scheduling problem in which each machine imposes a preferential order over the jobs and schedules the jobs accordingly once assigned to it. We study the problem of minimizing the total completion time, distinguishing between identical and unrelated machines, machine-dependent and identical priority lists, or a constant number of different priority classes. Additionally, we consider the setting in which the priority list on a machine must satisfy longest processing time first. We resolve the computational complexity of the problem and provide a clear distinction between problems that are polynomial time solvable and APX-hard.
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.
