Showing 1 - 10 of 649,942
This paper calls for a change in paradigm in lot sizing and scheduling. Traditionally, a discrete time scale is chosen to model lot sizing and scheduling. As an alternative, the so-called block planning concept is proposed which is based on a continuous representation of time. A mixed-integer...
Persistent link: https://www.econbiz.de/10010414317
Two heuristics based on branch and bound (B&B) are developed to solve closed-loop material requirements planning (MRP) lot-sizing problems that have general product structures and variable costs. A “look ahead method'’(LAM) heuristic allows for variable production/purchasing costs and uses a...
Persistent link: https://www.econbiz.de/10013290419
propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple … Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our …
Persistent link: https://www.econbiz.de/10014030790
We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...
Persistent link: https://www.econbiz.de/10014033651
Persistent link: https://www.econbiz.de/10013192673
Persistent link: https://www.econbiz.de/10012293362
Persistent link: https://www.econbiz.de/10011630931
Persistent link: https://www.econbiz.de/10011686222
Persistent link: https://www.econbiz.de/10012021991
proposed method outperforms the Wagner-Whitin algorithm and the Silver-Meal heuristic, under several demand patterns, within a …
Persistent link: https://www.econbiz.de/10014033650