Open-shop dense schedules: properties and worst-case performance ratio Rongjun ChenWanzhen HuangGuochun Tang OriginalPaper 25 September 2009 Pages: 3 - 11
Comparing online algorithms for bin packing problems Leah EpsteinLene M. FavrholdtJens S. Kohrt OriginalPaper 12 September 2009 Pages: 13 - 21
Analysis of three mathematical models of the Staff Rostering Problem É. NaudinP. Y. C. ChanG. Weil OriginalPaper 24 December 2009 Pages: 23 - 38
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems Dvir ShabtayYaron Bensoussan OriginalPaper 18 November 2010 Pages: 39 - 47
Design and statistical analysis of a hybrid local search algorithm for course timetabling Ruggero BellioLuca Di GasperoAndrea Schaerf OriginalPaper 03 February 2011 Pages: 49 - 61
Absolute approximation ratios for packing rectangles into bins Rolf HarrenRob van Stee OriginalPaper Open access 25 April 2009 Pages: 63 - 75
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines Peihai LiuXiwen LuYang Fang OriginalPaper 31 December 2009 Pages: 77 - 81
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice Peter DemeesterBurak BilginGreet Vanden Berghe OriginalPaper 17 November 2011 Pages: 83 - 103
Improved multi-processor scheduling for flow time and energy Tak-Wah LamLap-Kei LeePrudence W. H. Wong OriginalPaper 25 November 2009 Pages: 105 - 116
Using a SAT-solver to schedule sports leagues Andrei HorbachThomas BartschDirk Briskorn OriginalPaper 16 September 2010 Pages: 117 - 125