| 1 | -- | 2 | Edmund K. Burke, Michael Pinedo. Editorial - Journal of Scheduling (2012) |
| 3 | -- | 11 | Rongjun Chen, Wanzhen Huang, Zhongxian Men, Guochun Tang. Open-shop dense schedules: properties and worst-case performance ratio |
| 13 | -- | 21 | Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt. Comparing online algorithms for bin packing problems |
| 23 | -- | 38 | É. Naudin, P. Y. C. Chan, Michael Hiroux, T. Zemmouri, Georges Weil. Analysis of three mathematical models of the Staff Rostering Problem |
| 39 | -- | 47 | Dvir Shabtay, Yaron Bensoussan. Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems |
| 49 | -- | 61 | Ruggero Bellio, Luca Di Gaspero, Andrea Schaerf. Design and statistical analysis of a hybrid local search algorithm for course timetabling |
| 63 | -- | 75 | Rolf Harren, Rob van Stee. Absolute approximation ratios for packing rectangles into bins |
| 77 | -- | 81 | Peihai Liu, Xiwen Lu, Yang Fang. A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines |
| 83 | -- | 103 | Peter Demeester, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe. A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice |
| 105 | -- | 116 | Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong. Improved multi-processor scheduling for flow time and energy |
| 117 | -- | 125 | Andrei Horbach, Thomas Bartsch, Dirk Briskorn. Using a SAT-solver to schedule sports leagues |