On maintenance scheduling of production units

DOI10.1016/0377-2217(82)90034-0zbMath0475.90036OpenAlexW1968369752MaRDI QIDQ1159562

Laureano Fernando Escudero Bueno

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90034-0

zbMATH Keywords

branch-and-bound algorithmoptimal solutioncomputational experienceimplicit enumerationmaintenance schedulingrelaxationslarge-scale mixed integer nonlinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)

Related Items

S3 sets. An extension of the Beale-Tomlin special ordered sets, Strategies for LP-based solving a general class of scheduling problems, On a stochastic sequencing and scheduling problem, Managing a portfolio of long term service agreements, On a fix-and-relax framework for a class of project scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• The 0-1 knapsack problem with multiple choice constraints
• A o(n logn) algorithm for LP knapsacks with GUB constraints
• Global optimization using special ordered sets
• Experiments in mixed-integer linear programming using pseudo-costs
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The Multiple-Choice Knapsack Problem
• Enumerative Methods in Integer Programming
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey