Single item lot-sizing problem for a warm/cold process with immediate lost sales

DOI10.1016/J.EJOR.2006.06.070zbMATH Open1137.90439OpenAlexW2044261603MaRDI QIDQ2467270FDOQ2467270

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

Recommendations

• Single item lot sizing problems
• The single-item lot-sizing problem with immediate lost sales
• Progress with single-item lot-sizing
• Single item lot-sizing with non-decreasing capacities
• Lot sizing with bounded inventory and lost sales
• scientific article; zbMATH DE number 849177
• A single-item lot-sizing problem with a by-product and inventory capacities
• Lot sizing for a single product recovery system with variable setup numbers

zbMATH Keywords

schedulinglost salessetup timessetup costswarm/cold processdynamic lot sizing

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A survey of scheduling problems with setup times or costs
• Dynamic version of the economic lot size model
• Single item lot sizing problems
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Improved Algorithms for Economic Lot Size Problems
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
• Title not available (Why is that?)
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Computational Complexity of the Capacitated Lot Size Problem
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• The discrete lot-sizing and scheduling problem
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• The single-item lot-sizing problem with immediate lost sales
• A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• Progress with single-item lot-sizing
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• Reduced production rates in the economic lot scheduling problem
• Dynamic knapsack sets and capacitated lot-sizing
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
• Controllable production rates in a family production context

Cited In (9)

• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• Single-item dynamic lot-sizing problems: an updated survey
• 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
• Just-in-Time Planning and Lot-Sizing
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales
• A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan
• The single-item lot-sizing problem with immediate lost sales
• Production-inventory control policy under warm/cold state-dependent fixed costs and stochastic demand: partial characterization and heuristics

This page was built for publication: Single item lot-sizing problem for a warm/cold process with immediate lost sales

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467270)