Abstract
This work deals with the unrelated parallel machine scheduling problem with machine and job-sequence dependent setup times. The studied objective is the minimization of the total weighted earliness and tardiness. We study existing Mixed Integer Programming (MIP) mathematical formulations. A genetic algorithm is proposed, which includes a procedure for inserting idle times in the production sequence in order to improve the objective value. We also present a benchmark of small and large instances to carry out the computational experiments. After an exhaustive computational and statistical analysis, the conclusion is that the proposed method shows a good performance.
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.
