1. An efficient memetic algorithm for the graph partitioning problem

   • Philippe Galinier
   • Zied Boujbel
   • Michael Coutinho Fernandes

   OriginalPaper 05 October 2011 Pages: 1 - 22

2. Improved complexity results for several multifacility location problems on trees

   • Jörg Kalcsics

   OriginalPaper 01 June 2011 Pages: 23 - 36

3. An optimization model and a solution algorithm for the many-to-many car pooling problem

   • Shangyao Yan
   • Chun-Ying Chen

   OriginalPaper 26 August 2011 Pages: 37 - 71

4. Inventory models with ramp type demand rate, time dependent deterioration rate, unit production cost and shortages

   • K. Skouri
   • I. Konstantaras
   • K. S. Chaudhuri

   OriginalPaper 08 October 2011 Pages: 73 - 95

5. Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines

   • Manzhan Gu
   • Xiwen Lu

   OriginalPaper 08 October 2011 Pages: 97 - 113

6. Value of supplier’s capacity information in a two-echelon supply chain

   • İsmail Serdar Bakal
   • Nesim Erkip
   • Refik Güllü

   OriginalPaper 11 August 2011 Pages: 115 - 135

7. Ensuring the boundedness of the core of games with restricted cooperation

   • Michel Grabisch

   OriginalPaper 22 June 2011 Pages: 137 - 154

8. Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects

   • Ji-Bo Wang
   • Ming-Zheng Wang

   OriginalPaper 23 June 2011 Pages: 155 - 169

9. Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

   • George Steiner
   • Rui Zhang

   OriginalPaper 13 October 2011 Pages: 171 - 181

10. To lay out or not to lay out?

    • Sadegh Niroomand
    • Szabolcs Takács
    • Béla Vizvári

    OriginalPaper 19 October 2011 Pages: 183 - 192

11. Controlling job arrivals with processing time windows into Batch Processor Buffer

    • John Benedict C. Tajan
    • Appa Iyer Sivakumar
    • Stanley B. Gershwin

    OriginalPaper 03 September 2011 Pages: 193 - 218

12. A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty

    • André Rossi
    • Alexis Aubry
    • Mireille Jacomino

    OriginalPaper 04 October 2011 Pages: 219 - 249

13. A note on the proof of the complexity of the little-preemptive open-shop problem

    • Evgeny V. Shchepin
    • Nodari Vakhania

    BriefCommunication 06 September 2011 Pages: 251 - 253

14. Existence conditions for generalized vector variational inequalities

    • M. Durea
    • R. Strugariu

    BriefCommunication 03 September 2011 Pages: 255 - 262

15. List of Referees

    Acknowledgments 11 November 2011 Pages: 263 - 274