On a fix-and-relax framework for a class of project scheduling problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2013754
- Hierarchical models for multi-project planning and scheduling
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- On a stochastic sequencing and scheduling problem
- Scheduling of resource-constrained projects
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 1538621 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A cutting plane approach to capacitated lot-sizing with start-up costs
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
- A time indexed formulation of non-preemptive single machine scheduling problems
- MIP modelling of changeovers in production planning and scheduling problems
- Octane: A New Heuristic for Pure 0–1 Programs
- On maintenance scheduling of production units
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Pivot and Complement–A Heuristic for 0-1 Programming
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Scheduling of resource-constrained projects
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
Cited in
(21)- Generalized relax-and-fix heuristic
- Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Optimization-based heuristics for underground mine scheduling
- Fix and relax heuristic for a stochastic lot-sizing problem
- On risk management of a two-stage stochastic mixed 0-1 model for the closed-loop supply chain design problem
- On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- Using and extending fix-and-relax to solve maritime inventory routing problems
- Fix-and-relax approaches for controlled tabular adjustment
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- 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
- Optimizing assignment of Tomahawk cruise missile missions to firing units
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
- The stochastic capacitated branch restructuring problem
- Dynamic revenue management in a passenger rail network under price and fleet management decisions
- On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty
This page was built for publication: On a fix-and-relax framework for a class of project scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817205)
