| Article ID: | iaor2009965 |
| Country: | Netherlands |
| Volume: | 54 |
| Issue: | 4 |
| Start Page Number: | 764 |
| End Page Number: | 782 |
| Publication Date: | May 2008 |
| Journal: | Computers & Industrial Engineering |
| Authors: | Fowler John W., Chen Yan, Pfund Michele, Gadkari Amit |
| Keywords: | heuristics |
In this research we are interested in scheduling jobs with ready times on identical parallel machines with sequence dependent setups. Our objective is to minimize the total weighted tardiness. As this problem is NP-Hard, we develop a heuristic to solve this problem in reasonable time. Our approach is an extension of the apparent tardiness cost with setups approach by Lee and Pinedo to allow non-ready jobs to be scheduled – meaning we allow a machine to remain idle for a high priority job arriving at a later time.