A Dynamic Lot-Sizing Model with Demand Time Windows
Management Science
Inventory lot-sizing with supplier selection
Computers and Operations Research
Lot-sizing with production and delivery time windows
Mathematical Programming: Series A and B
A discrete version of particle swarm optimization for flowshop scheduling problems
Computers and Operations Research
Capacitated Multi-Item Lot-Sizing Problems with Time Windows
Operations Research
Computers & Mathematics with Applications
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
Computers and Operations Research
Optimizing material procurement planning problem by two-stage fuzzy programming
Computers and Industrial Engineering
Production Planning by Mixed Integer Programming
Production Planning by Mixed Integer Programming
Capacitated dynamic lot-sizing problem with delivery/production time windows
Operations Research Letters
Dynamic lot-sizing model with demand time windows and speculative cost structure
Operations Research Letters
PSO with path relinking for resource allocation using simulation optimization
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper, we study a generalized production planning problem, that simultaneously investigates the two decisions that play critical roles in most firms, namely, production planning and order splitting and assignment. The problem takes into consideration the production time windows and capacities. We formulate the integrated problem as a linear mixed-integer program with a minimized total cost. A particle swarm optimization-based approach is developed to address the problem. Extensive computational experiments show that the proposed approach outperforms a commercial optimization package. Some managerial insights are also explored and reported. Finally, concluding remarks and future research directions are provided.