Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

DOI10.1016/j.cor.2009.06.007zbMath1175.90164OpenAlexW2036304717WikidataQ57719503 ScholiaQ57719503MaRDI QIDQ1040968

Socorro Rangel, Reinaldo Morabito, Deisemara Ferreira

Publication date: 27 November 2009

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

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

zbMATH Keywords

mixed integer programmingsoft drink industryproduction lot-scheduling modelsrelax and fix heuristics

Mathematics Subject Classification ID

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

Related Items

Simultaneous lotsizing and scheduling problems: a classification and review of models, Fix-and-relax approaches for controlled tabular adjustment, A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches, Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach, Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics, Integrated lot sizing and blending problems, Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem, A mixed integer programming model and solution method for the operation of an integrated water supply system, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, A kernel search heuristic for the multivehicle inventory routing problem, Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, An efficient matheuristic for offline patient-to-bed assignment problems, Generalized relax-and-fix heuristic

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete lot-sizing and scheduling problem
• On a fix-and-relax framework for a class of project scheduling problems
• Solution approaches for the soft drink integrated production lot sizing and scheduling problem
• Lot sizing and scheduling -- survey and extensions
• On practical resource allocation for production planning and scheduling with period overlapping setups
• The general lotsizing and scheduling problem
• Local branching
• Simultaneous lotsizing and scheduling on parallel machines
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• Lot sizing and furnace scheduling in small foundries
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance
• Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
• Variable neighborhood search and local branching
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS
• Computational Complexity of the Capacitated Lot Size Problem
• Benchmarking optimization software with performance profiles.