Browsing by Subject "Batch-partition heuristics"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item Open Access Minimizing Lmax for the single machine scheduling problem with family set-ups(Taylor & Francis, 2004) Schultz, S. R.; Hodgson, T. J.; King, R. E.; Taner, M. R.A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems.