Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
From MaRDI portal
Publication:539458
DOI10.1007/S10951-010-0197-6zbMATH Open1213.90124OpenAlexW2084886727MaRDI QIDQ539458FDOQ539458
Authors: António Aroso Menezes, Alistair Clark, Bernardo Almada-Lobo
Publication date: 30 May 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://eprints.uwe.ac.uk/11483/1/2nd_Revision_CLSP_with_NTS_and_SC_highlighted.pdf
Recommendations
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
- scientific article; zbMATH DE number 5049964
Cites Work
- The prize collecting traveling salesman problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- The traveling salesman problem: An overview of exact and approximate algorithms
- Lot sizing and scheduling -- survey and extensions
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The general lotsizing and scheduling problem
- Capacitated lot-sizing with sequence dependent setup costs
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- The capacitated lot-sizing problem with linked lot sizes
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- A framework for modelling setup carryover in the capacitated lot sizing problem
- A modified framework for modelling set-up carryover in the capacitated lotsizing problem
- Modeling of period overlapping setup times
- Cryptographic security of individual instances
Cited In (19)
- Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties
- Title not available (Why is that?)
- A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- Economic lot sizing problem with tank scheduling
- Modeling lotsizing and scheduling problems with sequence dependent setups
- Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
- Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Capacitated lot-sizing with sequence dependent setup costs
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
- Capacitated lot sizing with alternative routings and overtime decisions
- Pricing, relaxing and fixing under lot sizing and scheduling
- Agile two-stage lot-sizing and scheduling problem with reliability, customer satisfaction and behaviour under uncertainty: a hybrid metaheuristic algorithm
Uses Software
This page was built for publication: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539458)