Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
type: Item
instance of: scholarly article
title: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
zbMATH Open document ID: 1175.90164
author: Deisemara Ferreira
author: Reinaldo Morabito
author: Socorro Rangel
published in: Computers \& Operations Research
publication date: 2009-11-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5639640
zbMATH Keywords: relax and fix heuristics
zbMATH Keywords: production lot-scheduling models
zbMATH Keywords: soft drink industry
zbMATH Keywords: mixed integer programming
describes a project that uses: AMPL
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2009.06.007
OpenAlex ID: W2036304717
Wikidata QID: Q57719503
cites work: Solution approaches for the soft drink integrated production lot sizing and scheduling problem
cites work: Lot sizing and furnace scheduling in small foundries
cites work: COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS
cites work: The discrete lot-sizing and scheduling problem
cites work: Q3525910
cites work: Lot sizing and scheduling -- survey and extensions
cites work: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
cites work: Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
cites work: Multi-machine scheduling with deteriorating jobs and scheduled maintenance
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Simultaneous lotsizing and scheduling on parallel machines
cites work: Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
cites work: The general lotsizing and scheduling problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Q4054818
cites work: On practical resource allocation for production planning and scheduling with period overlapping setups
cites work: On a fix-and-relax framework for a class of project scheduling problems
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: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Local branching
cites work: Variable neighborhood search and local branching
DBLP publication ID: journals/cor/FerreiraMR10
DOI: 10.1016/J.COR.2009.06.007
description: scientific article; zbMATH DE number 5639640