Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
From MaRDI portal
Publication:983631
DOI10.1007/s10951-009-0156-2zbMath1193.90104OpenAlexW2092796159MaRDI QIDQ983631
Taís M. Valeriano, Geraldo Robson Mateus, Martín Gómez Ravetti, Mauricio C. de Souza
Publication date: 24 July 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0156-2
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator ⋮ A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem ⋮ A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production ⋮ A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry ⋮ Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
- A scheduling problem with unrelated parallel machines and sequence dependent setups
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- 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
- Lot sizing and scheduling -- survey and extensions
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Integration of lotsizing and scheduling decisions in a job-shop
- The general lotsizing and scheduling problem
- On the polyhedral structure of a multi-item production planning model with setup times
- Simultaneous lotsizing and scheduling on parallel machines
- Greedy randomized adaptive search procedures
- Capacitated lot-sizing with sequence dependent setup costs
- Lot sizing and furnace scheduling in small foundries
- Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- The Deterministic Dynamic Product Cycling Problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- An Integrated Model for Job-Shop Planning and Scheduling
- Mersenne twister
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Planning and Scheduling in Manufacturing and Services
- A modified shifting bottleneck procedure for job-shop scheduling
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- Production Planning by Mixed Integer Programming
This page was built for publication: Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
