Similar Search Results

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

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

Improved exact algorithms to economic lot-sizing with piecewise linear production costs

Ou, Jinwen - In: European journal of operational research : EJOR 256 (2017) 3, pp. 777-784

Persistent link: https://www.econbiz.de/10011639214

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines

Kress, Dominik; Barketau, Maksim; Pesch, Erwin - In: Journal of scheduling 21 (2018) 6, pp. 595-606

Persistent link: https://www.econbiz.de/10011955836

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

A Geometric Algorithm to Solve the Ni/G/Ni/Nd Capacitated Lot-Sizing Problem in O(T^2) Time

van den Heuvel, Wilco; Wagelmans, Albert P. M. - 2010

NP-hard, but there exist special cases that can be solved in polynomial time. We derive a backward algorithm, based on … the forward algorithm by Chen et al. (1994), to solve the general CLSP. By adapting this backward algorithm, we arrive at … a new O(T^2) algorithm for the CLSP with non-increasing setup cost, general holding cost, non-increasing production cost …

Persistent link: https://www.econbiz.de/10014029778

Integrated Algorithms to Solve the Production Lot-Sizing Problem with Capacity Adjustment

Feng, Jiejian; Zhang, Michael; Yang, Jinglei; He, Kai - 2023

, to obtain an eﬃcient algorithm. This algorithm complexity is one level lower than the algorithm without non …

Persistent link: https://www.econbiz.de/10014360858

A decomposition algorithm for single and multiobjective integrated market selection and production planning

Heuvel, Wilco van den; Ağralı, Semra; Taşkın, Z. Caner - In: INFORMS journal on computing : JOC ; charting new … 35 (2023) 6, pp. 1439-1453

Persistent link: https://www.econbiz.de/10014471528

Using the proximal policy optimisation algorithm for solving the stochastic capacitated lot sizing problem

Hezewijk, Lotte van; Dellaert, Nico; Van Woensel, Tom; … - In: International journal of production research 61 (2023) 6, pp. 1955-1978

Persistent link: https://www.econbiz.de/10014230536

Solving a combined cutting-stock and lot-sizing problem with a column generating procedure

Non°as, Sigrid Lise; Thorstenson, Anders - In: Computers & operations research : and their … 35 (2008) 10, pp. 3371-3392

Persistent link: https://www.econbiz.de/10003713071