Narrow search
Showing 1 - 10 of 698
Cover Image
Journal of scheduling
New York, NY : Springer Science + Business Media LLC; … - 1.1998 -
Persistent link: https://www.econbiz.de/10001402476
Cover Image
Exact and approximation algorithms for the operational fixed interval scheduling problem
Van Wassenhove, Luk N.; Kroon, Leo G.; Salomon, Marc - 1992
Persistent link: https://www.econbiz.de/10000831742
Cover Image
Heuristics for the discrete lotsizing and scheduling problems with setup times
Cattrysse, Dirk G. (contributor) - 1991
Persistent link: https://www.econbiz.de/10000816605
Cover Image
Local search heuristics for single machine scheduling with batching to minimize total weighted completion time
Crauwels, H. A.; Potts, Chris N.; Van Wassenhove, Luk N. - 1995
Persistent link: https://www.econbiz.de/10000907933
Cover Image
Ausgewählte Lösungsmethoden für zweidimensionale Zuschnittprobleme mit Reihenfolgerestriktionen in der Flachglasindustrie
Schleiff, Thomas - 1998 - Als. Ms. gedr
Persistent link: https://www.econbiz.de/10000986375
Cover Image
Minimizing total weighted tardiness on single batch process machine with incompatible job families
Devpura, Amit (contributor) - In: Operations research proceedings 2000 : selected papers …, (pp. 366-371). 2001
Persistent link: https://www.econbiz.de/10001571657
Cover Image
Ausgewählte Lösungsmethoden für zweidimensionale Zuschnittsprobleme mit Reihenfolgeredistriktionen in der Flachglasindustrie
Lassman, Wolfgang; Schleiff, Thomas - In: IT-gestützte betriebswirtschaftliche …, (pp. 261-270). 2001
Persistent link: https://www.econbiz.de/10001605722
Cover Image
Complexity of vehicle routing and scheduling problems
Lenstra, J. K.; Kan, A. H. G. Rinnooy - 1979
Persistent link: https://www.econbiz.de/10001562610
Cover Image
Advanced production scheduling for batch plants in process industries
Neumann, Klaus; Schwindt, Christoph; Trautmann, Norbert - In: OR spectrum : quantitative approaches in management 24 (2002) 3, pp. 251-279
Persistent link: https://www.econbiz.de/10001696511