A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
type: Item
instance of: scholarly article
title: A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
zbMATH Open document ID: 1349.90053
author: Jing Xiao
author: Huasheng Yang
author: Canrong Zhang
author: Li Zheng
author: Jatinder N. D. Gupta
published in: Computers \& Operations Research
publication date: 2016-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6654025
zbMATH Keywords: capacitated lot-sizing and scheduling
zbMATH Keywords: sequence-dependent setup
zbMATH Keywords: unrelated parallel machines
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: simulated annealing
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2015.04.010
OpenAlex ID: W2004753507
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
cites work: An effective heuristic for the CLSP with set-up times
cites work: Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: Capacitated lot-sizing with sequence dependent setup costs
cites work: Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
cites work: Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
cites work: Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
cites work: Lotsizing and scheduling for production planning
cites work: Multiperiod production planning carrying over set-up time
cites work: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
cites work: Single item lot-sizing problems with backlogging on a single machine at a finite production rate
cites work: A heuristic approach for big bucket multi-level production planning problems
cites work: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
cites work: Lot-sizing with production and delivery time windows
cites work: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
cites work: Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
cites work: Scheduling
cites work: Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
cites work: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
cites work: Simultaneous lotsizing and scheduling on parallel machines
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Validation of subgradient optimization
DOI: 10.1016/J.COR.2015.04.010
description: scientific article; zbMATH DE number 6654025