Single item lot-sizing problem for a warm/cold process with immediate lost sales
From MaRDI portal
Publication:2467270
DOI10.1016/j.ejor.2006.06.070zbMath1137.90439OpenAlexW2044261603MaRDI QIDQ2467270
Emre Berk, Ayhan Özgür Toy, Öncü Hazır
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/11597
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Heuristics for the multi-item capacitated lot-sizing problem with lost sales, Production-inventory control policy under warm/cold state-dependent fixed costs and stochastic demand: partial characterization and heuristics, A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan, Just-in-Time Planning and Lot-Sizing, Single-item dynamic lot-sizing problems: an updated survey, Single item lot-sizing problem for a warm/cold process with immediate lost sales, A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities, Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
Cites Work
- Unnamed Item
- The discrete lot-sizing and scheduling problem
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Progress with single-item lot-sizing
- Dynamic knapsack sets and capacitated lot-sizing
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- The single-item lot-sizing problem with immediate lost sales
- A survey of scheduling problems with setup times or costs
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- Single item lot sizing problems
- Dynamic Version of the Economic Lot Size Model
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Controllable production rates in a family production context
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Computational Complexity of the Capacitated Lot Size Problem
- Improved Algorithms for Economic Lot Size Problems
- Reduced production rates in the economic lot scheduling problem
- Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints