On a fix-and-relax framework for a class of project scheduling problems

DOI10.1007/s10479-005-3970-8zbMath1091.90017OpenAlexW2066680795MaRDI QIDQ817205

Javier Salmeron, Laureano Fernando Escudero Bueno

Publication date: 7 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-3970-8

zbMATH Keywords

0-1 programmingbranch-and-bound selective searchmulti-period project management

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

Optimizing assignment of Tomahawk cruise missile missions to firing units, Optimization-based heuristics for underground mine scheduling, Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming, Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty, Fix-and-relax approaches for controlled tabular adjustment, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, Using and extending fix-and-relax to solve maritime inventory routing problems, A three-phase matheuristic algorithm for the multi-day task assignment problem, On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon, Multi-period single-allocation hub location-routing: models and heuristic solutions, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, The stochastic capacitated branch restructuring problem, On risk management of a two-stage stochastic mixed 0-1 model for the closed-loop supply chain design problem, A Lagrangian heuristic for satellite range scheduling with resource constraints, Fix and relax heuristic for a stochastic lot-sizing problem, On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem, On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Generalized relax-and-fix heuristic

Uses Software

• XPRESS
• Octane

Cites Work

• Unnamed Item
• Unnamed Item
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• On maintenance scheduling of production units
• A time indexed formulation of non-preemptive single machine scheduling problems
• MIP modelling of changeovers in production planning and scheduling problems
• On practical resource allocation for production planning and scheduling with period overlapping setups
• A cutting plane approach to capacitated lot-sizing with start-up costs
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem
• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• Scheduling of resource-constrained projects
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• Octane: A New Heuristic for Pure 0–1 Programs
• Pivot and Complement–A Heuristic for 0-1 Programming
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• A Computational Study of Search Strategies for Mixed Integer Programming