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

DOI10.1016/S0377-2217(96)00020-3zbMath0918.90087OpenAlexW2061785108MaRDI QIDQ1278129

Yvan Dumas, Marius M. Solomon, Marc Salomon, Luk N. Van Wassenhove, Stéphane Dauzère-Pérès

Publication date: 19 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00020-3

zbMATH Keywords

dynamic programmingtime windowstravelling salesmandiscrete lotsizingsequence dependent set-up costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Multi-product valid inequalities for the discrete lot-sizing and scheduling problem ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ Modeling industrial lot sizing problems: a review ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources ⋮ Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal ⋮ On discrete lot-sizing and scheduling on identical parallel machines ⋮ Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching ⋮ The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times ⋮ Dynamic nonlinear modelization of operational supply chain systems ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS ⋮ Lot sizing and scheduling -- survey and extensions ⋮ The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability ⋮ Simultaneous lotsizing and scheduling on parallel machines

Cites Work

• The discrete lot-sizing and scheduling problem
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Discrete Lotsizing and Scheduling by Batch Sequencing
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

This page was built for publication: 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