The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
From MaRDI portal
Publication:1577995
Recommendations
Cites work
- `` Strong NP-Completeness Results
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- An Efficient Algorithm for Multi-Item Scheduling
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Batching in single operation manufacturing systems
- Batching to Minimize Flow Times on One Machine
- Deterministic lotsizing models for production planning
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 4079162 (Why is no real title available?)
- scientific article; zbMATH DE number 3786484 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Job Shop Scheduling by Simulated Annealing
- Minimum Change-Over Scheduling of Several Products on One Machine
- Optimization by simulated annealing
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- Scheduling Groups of Jobs on a Single Machine
- Simulated Annealing – An Annotated Bibliography
- 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
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- The discrete lot-sizing and scheduling problem
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(18)- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- 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”
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- Dynamic lot sizing for multiple products with a new joint replenishment model
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- DLSP for two-stage multi-item batch production
- scientific article; zbMATH DE number 4197717 (Why is no real title available?)
- Modeling industrial lot sizing problems: a review
- 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: The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577995)
