Minimizing Lmax for the single machine scheduling problem with family set-ups

Schultz, S. R.Hodgson, T. J.King, R. E.Taner, M. R.2016-02-082016-02-0820040020-7543http://hdl.handle.net/11693/24210A 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.EnglishAlgorithmsApproximation theoryFunctionsHeuristic methodsOptimal control systemsSchedulingBatch-partition heuristicsMachine scheduling problemPair-wise switchingMinimizing Lmax for the single machine scheduling problem with family set-upsArticle10.1080/002075404100017165611366-588X