Narrow search
Showing 61 - 70 of 638,257
Cover Image
Effect of limited capacity on optimal planning parameters for a multi-item production system with setup times and advance demand information
Altendorfer, Klaus - In: International journal of production research 57 (2019) 6, pp. 1892-1913
Persistent link: https://www.econbiz.de/10012183933
Cover Image
Decentralised capacitated planning with minimal-information sharing in a 2-echolon supply chain
Ogier, Maxime; Chan, Felix Tung Sun; Chung, Sai Ho; … - In: International journal of production research 53 (2015) 16, pp. 4927-4950
Persistent link: https://www.econbiz.de/10011344496
Cover Image
Service-level-driven procurement and production lot-sizing problem with demand fulfilment
Tomazella, Caio Paziani; Santos, Maristela Oliveira; … - In: International journal of production research 62 (2024) 6, pp. 1977-1998
Persistent link: https://www.econbiz.de/10014546335
Cover Image
Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
Kim, Seong-in; Han, Junghee; Lee, Youngho; Park, Eunkyung - In: Computers & operations research : and their … 37 (2010) 2, pp. 302-314
Persistent link: https://www.econbiz.de/10003899017
Cover Image
Optimal lot-sizing algorithms for complex product structures
Afentakis, Panayotis; Gavish, Bezalel - In: Operations research 34 (1986) 2, pp. 237-249
Persistent link: https://www.econbiz.de/10003479370
Cover Image
A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing
Li, Xiangyong; Baki, Mohammed Fazle; Tian, Peng; … - In: Omega : the international journal of management science 42 (2014), pp. 75-87
Persistent link: https://www.econbiz.de/10010204524
Cover Image
An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities
Okhrin, Irena; Richter, Knut - In: European journal of operational research : EJOR 211 (2011) 3, pp. 507-514
Persistent link: https://www.econbiz.de/10008933390
Cover Image
A new Dantzig-Wolfe reformulation and branch-and-price algorithm for capacitated lot sizing problem with set up times
Degraeve, Zeger (contributor); Jans, Raf (contributor) - 2003 - [Elektronische Ressource]
Persistent link: https://www.econbiz.de/10001765909
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
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