Abstract
This study proposes a look-ahead heuristic to minimize the total weighted tardiness on the identical parallel machines. When a machine becomes idle, it selects a job from available jobs and near-future jobs to process. Different from other look-ahead heuristics, the proposed look-ahead heuristic not only looks ahead (considering a limited number of future jobs) but also looks back (the selected job had chance to be scheduled before the last job on each machine). The proposed look-ahead heuristic compares favorably with available look-ahead heuristics and non-look-ahead heuristic to minimize the total weighted tardiness on the identical parallel machines.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
