A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times

DOI10.1016/j.cor.2015.04.010zbMath1349.90053OpenAlexW2004753507MaRDI QIDQ342038

Jing Xiao, Huasheng Yang, Jatinder N. D. Gupta, Li Zheng, Canrong Zhang

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.010

zbMATH Keywords

Lagrangian relaxationsimulated annealingunrelated parallel machinescapacitated lot-sizing and schedulingsequence-dependent setup

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (16)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Rescheduling problems with allowing for the unexpected new jobs arrival ⋮ Agile two-stage lot-sizing and scheduling problem with reliability, customer satisfaction and behaviour under uncertainty: a hybrid metaheuristic algorithm ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry ⋮ Impact analysis of flexibility on the integrated lot sizing and supplier selection problem ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems ⋮ 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 ⋮ Re-entrant flowshop scheduling with learning considerations to minimize the makespan ⋮ A new model and algorithm for uncertain random parallel machine scheduling problem ⋮ A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups

Cites Work

• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• A heuristic approach for big bucket multi-level production planning problems
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
• Lotsizing and scheduling for production planning
• Simultaneous lotsizing and scheduling on parallel machines
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate
• Capacitated lot-sizing with sequence dependent setup costs
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
• Lot-sizing with production and delivery time windows
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
• Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
• Deterministic Production Planning: Algorithms and Complexity
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Multiperiod production planning carrying over set-up time
• An effective heuristic for the CLSP with set-up times
• Validation of subgradient optimization
• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
• Scheduling

This page was built for publication: A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times