Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

DOI10.1007/s10951-010-0197-6zbMath1213.90124OpenAlexW2084886727MaRDI QIDQ539458

António Aroso Menezes, Bernardo Almada-Lobo, Alistair Richard Clark

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

zbMATH Keywords

integer programminglot-sizing and schedulingnontriangular setupssetup crossover

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Modeling lotsizing and scheduling problems with sequence dependent setups ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ Agile two-stage lot-sizing and scheduling problem with reliability, customer satisfaction and behaviour under uncertainty: a hybrid metaheuristic algorithm ⋮ A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem ⋮ A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties ⋮ Economic lot sizing problem with tank scheduling ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ 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 ⋮ Pricing, relaxing and fixing under lot sizing and scheduling

Uses Software

• VRP

Cites Work

• The traveling salesman problem: An overview of exact and approximate algorithms
• The vehicle routing 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
• Modeling of period overlapping setup times
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• Cryptographic Security of Individual Instances
• The prize collecting traveling salesman problem
• A framework for modelling setup carryover in the capacitated lot sizing problem
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• A modified framework for modelling set-up carryover in the capacitated lotsizing problem
• Single machine multi-product capacitated lot sizing with sequence-dependent setups

This page was built for publication: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups