Narrow search
Showing 1 - 10 of 84,622
Cover Image
Discrete multi-module capacitated lot-sizing problems with multiple items
Kulkarni, Kartik; Bansal, Manish - In: Operations research letters 50 (2022) 2, pp. 168-175
Persistent link: https://www.econbiz.de/10013192673
Cover Image
Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
Wei, Mingyuan; Qi, Mingyao; Wu, Tao; Zhang, Canrong - In: European journal of operational research : EJOR 277 (2019) 2, pp. 521-541
Persistent link: https://www.econbiz.de/10012021991
Cover Image
Energy-aware lot sizing problem : complexity analysis and exact algorithms
Rapine, Christophe; Goisque, Guillaume; Akbalik, Ayse - In: International journal of production economics 203 (2018), pp. 254-263
Persistent link: https://www.econbiz.de/10011900441
Cover Image
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Akbalik, Ayse; Hadj-Alouane, Atidel B.; Sauer, Nathalie; … - In: European journal of operational research : EJOR 257 (2017) 2, pp. 483-493
Persistent link: https://www.econbiz.de/10011639678
Cover Image
Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
Li, Shi - In: Mathematics of operations research 45 (2020) 3, pp. 947-965
Persistent link: https://www.econbiz.de/10012293362
Cover Image
Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
Gayon, Jean-Philippe; Massonnet, Guillaume; Rapine, … - In: Mathematics of operations research 42 (2017) 3, pp. 854-875
Persistent link: https://www.econbiz.de/10011742538
Cover Image
Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
Malekian, Yaser; Mirmohammadi, S. Hamid; Bijari, Mehdi - In: Computers & operations research : and their … 134 (2021), pp. 1-14
Persistent link: https://www.econbiz.de/10012649533
Cover Image
An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
Shahvari, Omid; Logendran, Rasaratnam - In: Computers & operations research : and their … 77 (2017), pp. 154-176
Persistent link: https://www.econbiz.de/10011630931
Cover Image
Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops
Rohaninejad, Mohammad; Sahreian, Rashed; Vahedi Nouri, … - In: RAIRO / Operations research 50 (2016) 3, pp. 587-609
Persistent link: https://www.econbiz.de/10011686222
Cover Image
A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
Ou, Jinwen - In: Operations research letters 45 (2017) 5, pp. 493-497
Persistent link: https://www.econbiz.de/10011774703