![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
OR Spectrum, Volume 35
Volume 35, Number 1, January 2013
- Sofia Panagiotidou, George Nenes
, Christos Zikopoulos:
Optimal procurement and sampling decisions under stochastic yield of returns in reverse supply chains. 1-32 - Florian Seeanner, Herbert Meyr
:
Multi-stage simultaneous lot-sizing and scheduling for flow line production. 33-73 - Stefan Helber
, Florian Sahling
, Katja Schimmelpfeng
:
Dynamic capacitated lot sizing with random demand and dynamic safety stocks. 75-105 - Thomas Wensing, Heinrich Kuhn:
Analysis of a multi-component periodic review inventory system in an assembly environment. 107-126 - Ek Peng Chew, Loo Hay Lee
, Shudong Liu:
Dynamic rationing and ordering policies for multiple demand classes. 127-151 - Sven Axsäter:
When is it feasible to model low discrete demand by a normal distribution? 153-162 - Ek Peng Chew, Loo Hay Lee
, Chee-Khian Sim
:
The impact of supply chain visibility when lead time is random. 163-190 - Peter Letmathe
, Lars Petersen, Marcus Schweitzer:
Capacity management under uncertainty with inter-process, intra-process and demand interdependencies in high-flexibility environments. 191-219 - Nasuh C. Buyukkaramikli
, J. Will M. Bertrand, Henny P. G. van Ooijen:
Periodic capacity management under a lead-time performance constraint. 221-249 - Michiel M. Jansen, Ton G. de Kok
, Jan C. Fransoo
:
Lead time anticipation in Supply Chain Operations Planning. 251-290 - Armin Scholl, Nils Boysen
, Malte Fliedner:
The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics. 291-320 - Acknowledgement to Referees. 321-323
Volume 35, Number 2, March 2013
- Ulrich Derigs, Stefan Friederichs:
Air cargo scheduling: integrated models and solution procedures. 325-362 - Byung Kwon Lee, Kap Hwan Kim:
Optimizing the yard layout in container terminals. 363-398 - Florian Jaehn:
Positioning of loading units in a transshipment yard storage area. 399-416 - Xinjia Jiang, Ek Peng Chew, Loo Hay Lee
, Kok Choon Tan:
Flexible space-sharing strategy for storage yard management in a transshipment hub port. 417-439 - M. P. M. Hendriks, Erjen Lefeber
, Jan Tijmen Udding:
Simultaneous berth allocation and yard planning at tactical level. 441-456 - Kris Braekers
, An Caris
, Gerrit K. Janssens:
Integrated planning of loaded and empty container movements. 457-478 - Nils Boysen
, Dirk Briskorn
, Martin Tschöke:
Truck scheduling in cross-docking terminals with fixed outbound departures. 479-504 - Gleb Belov
, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer:
Conservative scales in packing problems. 505-542
Volume 35, Number 3, July 2013
- Tammy Drezner, Zvi Drezner:
Voronoi diagrams with overlapping regions. 543-561 - Remco Germs, Nicky D. van Foreest
:
Analysis of finite-buffer state-dependent bulk queues. 563-583 - Li Ding, Kevin D. Glazebrook
:
Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing. 585-608 - Tal Raviv
:
An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework. 609-638 - Christopher Garcia, Ghaith Rabadi
:
Exact and approximate methods for parallel multiple-area spatial scheduling with release times. 639-657 - Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
:
Measures of problem uncertainty for scheduling with interval processing times. 659-689 - Rui Jiang, Michael Jong Kim, Viliam Makis:
Availability maximization under partial observations. 691-710 - Alena Otto
, Armin Scholl:
Reducing ergonomic risks by job rotation scheduling. 711-733 - Jan Christian Lang, Thomas Widjaja
:
OREX-J: towards a universal software framework for the experimental analysis of optimization algorithms. 735-769
Volume 35, Number 4, November 2013
- Laureano F. Escudero
, Stefan Minner:
Editorial special issue on "Robust and stochastic optimization in production systems and supply chain management". 771-772 - Douglas José Alem
, Reinaldo Morabito
:
Risk-averse two-stage stochastic programs in furniture plants. 773-806 - Tim Schöneberg, Achim Koberstein, Leena Suhl:
A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks. 807-834 - Ban Kawas, Marco Laumanns
, Eleni Pratsini:
A robust optimization approach to enhancing reliability in production planning under non-compliance risks. 835-865 - Walid Klibi, Alain Martel:
The design of robust value-creating supply chain networks. 867-903 - Ali Bozorgi-Amiri
, Mohamad Saeed Jabalameli, S. M. J. Mirzapour Al-e-hashem
:
A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty. 905-933 - Anil Arya
, Stefan Minner, Thomas Pfeiffer:
Editorial Special Issue on "Operations Research and Accounting in Supply Chain Coordination". 935-936 - Ying-Ju Chen:
Risk-incentives trade-off and outside options. 937-956 - François Larmande:
Voluntary ambiguity in incentive contracts. 957-974 - Michael Krapp, Johannes Nebel, Ramin Sahamie:
Using forecasts and managerial accounting information to enhance closed-loop supply chain management. 975-1007 - Markus Brunner:
Wholesale price discrimination with interdependent retailers. 1009-1037 - Ni-Na Yan, Bao-Wen Sun:
Coordinating loan strategies for supply chain financing with limited credit. 1039-1058 - Fouad El Ouardighi
, Steffen Jørgensen, Federico Pasin:
A dynamic game with monopolist manufacturer and price-competing duopolist retailers. 1059-1084
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.