Strategies for LP-based solving a general class of scheduling problems

DOI10.1007/BF02888416MaRDI QIDQ3468869zbMATH OpenFDO

Authors Gloria Pérez, Laureano F. Escudero Bueno

Publication date 1990

Published in Trabajos de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/40609

zbMATH Keywords

branch-and-boundcoefficient reductionlarge-scale pure 0-1 modelschedulingspecial ordered sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09)

Recommendations

• A survey of methods for the solution of problems of scheduling theory
• scientific article; zbMATH DE number 702559
• Parallel machine scheduling by column generation
• scientific article; zbMATH DE number 1187167
• MP or not MP: that is the question

Cites work

• A production planning problem in FMS
• Computer Codes for Problems of Integer Programming
• Global optimization using special ordered sets
• scientific article; zbMATH DE number 3643032 (Why is no real title available?)
• scientific article; zbMATH DE number 3908160 (Why is no real title available?)
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• On maintenance scheduling of production units
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

Cited in

(8)

• Applying a modified coefficient reduction method to a dynamic production scheduling model
• MP or not MP: that is the question
• An experimental study of LP-based approximation algorithms for scheduling problems
• Solving LP relaxations of large-scale precedence constrained problems
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• scientific article; zbMATH DE number 7112744 (Why is no real title available?)
• Adapting Branch-and-Bound for Real-World Scheduling Problems
• Integer Programming and Combinatorial Optimization

This page was built for publication: Strategies for LP-based solving a general class of scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468869)