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

DOI10.1007/BF02888416zbMath0693.90051MaRDI QIDQ3468869

Gloria Pérez, Laureano Fernando 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

schedulingbranch-and-boundspecial ordered setscoefficient reductionlarge-scale pure 0-1 model

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A production planning problem in FMS
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• On maintenance scheduling of production units
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Computer Codes for Problems of Integer Programming
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Global optimization using special ordered sets
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

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