Narrow search
Showing 1 - 10 of 633,962
Cover Image
Belastungsorientierte Just-in-Time Variantenfließfertigung
Drexl, Andreas; Kimms, Alf - 1999
Persistent link: https://www.econbiz.de/10001369769
Cover Image
Level scheduling for batched JIT supply
Boysen, Nils; Fliedner, Malte; Scholl, Armin - 2009
Persistent link: https://www.econbiz.de/10003844130
Cover Image
The product rate variation problem and its relevance in real world mixed-model assembly lines
Boysen, Nils; Fliedner, Malte; Scholl, Armin - 2007
Persistent link: https://www.econbiz.de/10003710542
Cover Image
Variantenfließfertigung
Boysen, Nils - 2005 - 1. Aufl.
Persistent link: https://www.econbiz.de/10002835679
Cover Image
Constraint propagation algorithms for the car sequencing problem
Matthiessen, Lars; Drexl, Andreas; Kimms, Alf - 2000
Persistent link: https://www.econbiz.de/10001546856
Cover Image
Level scheduling under limited resequencing flexibility
Boysen, Nils; Fliedner, Malte; Scholl, Armin - 2010
Persistent link: https://www.econbiz.de/10003975738
Cover Image
Scheduling just-in-time part supply for mixed-model assembly lines
Boysen, Nils; Bock, Stefan - 2010
Persistent link: https://www.econbiz.de/10003929329
Cover Image
Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
Emde, Simon; Boysen, Nils - In: European journal of operational research : EJOR 217 (2012) 2, pp. 287-299
Persistent link: https://www.econbiz.de/10009405544
Cover Image
Constraint propagation algorithms for the car sequencing problem
Matthiessen, Lars; Drexl, Andreas; Kimms, Alf - 2000
The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...
Persistent link: https://www.econbiz.de/10011734528