Abstract
We consider the problem of scheduling n jobs on m parallel and identical machines. The goal is to find an optimal permutation of the jobs and an optimal due date which jointly minimize an objective function consisting of earliness tardiness and completion time penalties. We show that the problem is NP-hard and present a polynomially solvable case. Furthermore a heuristic is developed and computationally demonstrated to be efficient in obtaining near-optimal solutions. Scope and purpose This study deals with the problem of scheduling a number of jobs on parallel machines. We assume that companies are mainly interested in two objectives, namely achieving small deviations from a common due date and short flowtimes. Therefore earliness tardiness and completion time penalties for the jobs are introduced. We are able to show that the problem is intractable and consequently develop an efficient heuristic to obtain near-optimal solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.