- Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov. Minimizing the number of late jobs on a single machine under due date uncertainty. J. Scheduling, 14(4):351-360, 2011.
- Marvin Mandelbaum, Dvir Shabtay. Scheduling unit length jobs on parallel machines with lookahead information. J. Scheduling, 14(4):335-350, 2011.
- Vladimir Kats, Eugene Levner. Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Scheduling, 14(3):267-279, 2011.
- Malte Fliedner, Nils Boysen, Armin Scholl. On the part inventory model sequencing problem: complexity and Beam Search heuristic. J. Scheduling, 14(1):17-25, 2011.
- Leandro Magatão, Lucia V. R. Arruda, Flávio Neves Jr.. A combined CLP-MILP approach for scheduling commodities in a pipeline. J. Scheduling, 14(1):57-87, 2011.
- Xiaoqiang Cai, Xianyi Wu, Xian Zhou. Scheduling deteriorating jobs on a single machine subject to breakdowns. J. Scheduling, 14(2):173-186, 2011.
- Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng. A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Scheduling, 14(4):361-369, 2011.
- Trung Hieu Tran, Kien Ming Ng. A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. J. Scheduling, 14(5):483-500, 2011.
- Jason A. D. Atkin, Edmund K. Burke, John S. Greenwood. A comparison of two methods for reducing take-off delay at London Heathrow airport. J. Scheduling, 14(5):409-421, 2011.
- Dvir Shabtay, George Steiner. A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J. Scheduling, 14(5):455-469, 2011.