1. Editorial

   • Edmund Burke
   • Michael Pinedo

   News 11 February 2012 Pages: 1 - 2

2. Open-shop dense schedules: properties and worst-case performance ratio

   • Rongjun Chen
   • Wanzhen Huang
   • Guochun Tang

   OriginalPaper 25 September 2009 Pages: 3 - 11

3. Comparing online algorithms for bin packing problems

   • Leah Epstein
   • Lene M. Favrholdt
   • Jens S. Kohrt

   OriginalPaper 12 September 2009 Pages: 13 - 21

4. Analysis of three mathematical models of the Staff Rostering Problem

   • É. Naudin
   • P. Y. C. Chan
   • G. Weil

   OriginalPaper 24 December 2009 Pages: 23 - 38

5. Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems

   • Dvir Shabtay
   • Yaron Bensoussan

   OriginalPaper 18 November 2010 Pages: 39 - 47

6. Design and statistical analysis of a hybrid local search algorithm for course timetabling

   • Ruggero Bellio
   • Luca Di Gaspero
   • Andrea Schaerf

   OriginalPaper 03 February 2011 Pages: 49 - 61

7. Absolute approximation ratios for packing rectangles into bins

   • Rolf Harren
   • Rob van Stee

   OriginalPaper Open access 25 April 2009 Pages: 63 - 75

8. A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

   • Peihai Liu
   • Xiwen Lu
   • Yang Fang

   OriginalPaper 31 December 2009 Pages: 77 - 81

9. A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

   • Peter Demeester
   • Burak Bilgin
   • Greet Vanden Berghe

   OriginalPaper 17 November 2011 Pages: 83 - 103

   

10. Improved multi-processor scheduling for flow time and energy

    • Tak-Wah Lam
    • Lap-Kei Lee
    • Prudence W. H. Wong

    OriginalPaper 25 November 2009 Pages: 105 - 116

11. Using a SAT-solver to schedule sports leagues

    • Andrei Horbach
    • Thomas Bartsch
    • Dirk Briskorn

    OriginalPaper 16 September 2010 Pages: 117 - 125