Just-in-Time Planning and Lot-Sizing
From MaRDI portal
Publication:2958674
DOI10.1007/978-1-4614-1123-9_9zbMath1355.90003OpenAlexW2248436193MaRDI QIDQ2958674
Safia Kedad-Sidhoum, Stéphane Dauzère-Pérès, Nabil Absi
Publication date: 3 February 2017
Published in: Just-in-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_9
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)
Cites Work
- Loss of customer goodwill in the uncapacitated lot-sizing problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Four equivalent lot-sizing models
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- Lot sizing with quality improvement and setup time reduction
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- Integration of lotsizing and scheduling decisions in a job-shop
- A new characterization for the dynamic lot size problem with bounded inventory
- The single-item lot-sizing problem with immediate lost sales
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts
- Economic lot sizing problem with inventory bounds
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- The significance of reducing setup times/setup costs
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- Lot-sizing with production and delivery time windows
- Single item lot sizing problems
- Dynamic Version of the Economic Lot Size Model
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- A Dynamic Lot-Sizing Model with Demand Time Windows
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A Lot-sizing Model for Just-in-time Manufacturing
- Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- An Integrated Model for Job-Shop Planning and Scheduling
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Improved Algorithms for Economic Lot Size Problems
- On the importance of sequencing decisions in production planning and scheduling
- Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches
- Dynamic lot‐sizing model with production time windows
- Lot sizing with bounded inventory and lost sales
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- The uncapacitated lot-sizing problem with sales and safety stocks
This page was built for publication: Just-in-Time Planning and Lot-Sizing