Some Extensions of the Discrete Lotsizing and Scheduling Problem
From MaRDI portal
Recommendations
Cited in
(37)- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
- Deterministic lotsizing models for production planning
- Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
- A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
- Lot sizing and scheduling -- survey and extensions
- 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
- Lotsizing and scheduling for production planning
- A linear description of the discrete lot-sizing and scheduling problem
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The general lotsizing and scheduling problem
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- Single item lot sizing problems
- Discrete lotsizing and scheduling by batch sequencing
- Just-in-time planning and lot-sizing
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- Hybrid methods for lot sizing on parallel machines
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Scheduling multiple products on parallel machines with setup costs
- The generalized scheduling problem for discrete production. II
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- DLSP for two-stage multi-item batch production
- Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems
- Proportional lot sizing and scheduling: Some extensions
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
- scientific article; zbMATH DE number 4197717 (Why is no real title available?)
- Modeling industrial lot sizing problems: a review
- The discrete lot-sizing and scheduling problem
- An efficient algorithm to check feasibility for two-level discrete lot-sizing and scheduling
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
This page was built for publication: Some Extensions of the Discrete Lotsizing and Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982669)
