Narrow search
Showing 1 - 10 of 25,816
Cover Image
Capacitated planned maintenance : models, optimization algorithms, combinatorial and polyhedral properties
Kuschel, Torben - 2017
Persistent link: https://www.econbiz.de/10011489107
Cover Image
Maschinenbelegungsplanung mehrstufiger Fließfertigungen : vom Modell zum Leitstand für die chemische Industrie
Schocke, Kai-Oliver - 2000
Persistent link: https://www.econbiz.de/10001460724
Cover Image
Multi-stage simultaneous lot-sizing and scheduling : planning of flow lines with shifting bottlenecks
Seeanner, Florian - 2013
Persistent link: https://www.econbiz.de/10009754089
Cover Image
MRP zur Materialplanung für Kreislaufprozesse : Optimierung von Absicherungsstrategien gegen Bedarfs- und Versorgungsrisiken
Gotzel, Christian - 2010 - 1. Aufl.
Persistent link: https://www.econbiz.de/10003836872
Cover Image
Choosing the daily schedule : expanding activity-based travel demand modelling
Feil, Matthias - 2010
Persistent link: https://www.econbiz.de/10008841882
Cover Image
Optimierung von Flugplänen : Anwendung quantitativer Methoden im Luftverkehr
Leibold, Karsten - 2001 - 1. Aufl.
Persistent link: https://www.econbiz.de/10001608288
Cover Image
Ein hierarchischer Ansatz zur Lösung von Ablaufplanungsproblemen im Bergbau : Darstellung am Beispiel des Örterbaus
Schulze, Marco - 2016
Persistent link: https://www.econbiz.de/10011507310
Cover Image
Contributions to exact approaches in combinatorial optimization
Gschwind, Timo - 2014
The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the...
Persistent link: https://www.econbiz.de/10010512631
Cover Image
Identical parallel machine scheduling problems : structural patterns, bounding techniques and solution procedures
Lawrinenko, Alexander - 2017
branch-and-bound algorithm these criteria have proved to be effective in limiting the solution space, particularly in the … criteria, derive several lower bound arguments and propose construction heuristics as well as a subset sum-based improvement … algorithm. Moreover, we present a tailored branch-and-bound method which is able to solve instances with up to 20 bins. …
Persistent link: https://www.econbiz.de/10011632673