1. Approximation algorithms for the joint replenishment problem with deadlines

   • Marcin Bienkowski
   • Jarosław Byrka
   • Neal E. Young

   OriginalPaper 27 August 2014 Pages: 545 - 560

   

2. Real-time scheduling to minimize machine busy times

   • Rohit Khandekar
   • Baruch Schieber
   • Tami Tamir

   OriginalPaper 19 December 2014 Pages: 561 - 573

   

3. Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems

   • Bita Tadayon
   • J. Cole Smith

   OriginalPaper 06 February 2015 Pages: 575 - 592

   

4. Scheduling with returnable containers

   • Arne Mensendiek

   OriginalPaper 25 March 2015 Pages: 593 - 605

   

5. Robust execution strategies for project scheduling with unreliable resources and stochastic durations

   • Na Fu
   • Hoong Chuin Lau
   • Pradeep Varakantham

   OriginalPaper 12 March 2015 Pages: 607 - 622

   

6. An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

   • Hans Kellerer
   • Vladimir Kotov
   • Michaël Gabay

   OriginalPaper 25 April 2015 Pages: 623 - 630

   

7. Identical coupled task scheduling: polynomial complexity of the cyclic case

   • Vassilissa Lehoux-Lebacque
   • Nadia Brauner
   • Gerd Finke

   OriginalPaper 24 June 2015 Pages: 631 - 644

   

8. Approximation algorithms for inventory constrained scheduling on a single machine

   • Ehab Morsy
   • Erwin Pesch

   OriginalPaper 03 June 2015 Pages: 645 - 653