S3 sets. An extension of the Beale-Tomlin special ordered sets

DOI10.1007/BF01589396MaRDI QIDQ1102852zbMATH OpenFDO

Authors Laureano F. Escudero Bueno

Publication date 1988

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01589396

zbMATH Keywords

additional exclusivity constraintsprecedence relationsshipsspecial ordered sets

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Review text

The considered scheduling problem consists of obtaining the time at which each desired operation will begin its assignment, such that the constraints given by the distribution of the operations in types, groups and classes, the precedence relationsships and the resource availabilities are satisfied and the assignment cost is minimal. The author introduces a new type of special ordered sets to handle additional exclusivity constraints, precedence relationsships more complex than tree-like structures, semi-active schedules and also other resources in addition to machines. Computational procedures are outlined and some experience on some practical problems is reported.

Recommendations

• A generalized assignment problem with special ordered sets: a polyhedral approach.
• Scheduling of resource tasks
• scientific article; zbMATH DE number 3894816
• Optimal two- and three-stage production schedules with set-up time included
• Implementations of special ordered sets in MP software

Cites work

• Computer Codes for Problems of Integer Programming
• Global optimization using special ordered sets
• 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
• 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

(10)

• Efficient reformulation for 0-1 programs -- methods and computational results
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• Two alternative models for farm management: Discrete versus continuous time horizon
• A global optimization point of view to handle non-standard object packing problems
• A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
• Implementations of special ordered sets in MP software
• On a fix-and-relax framework for a class of project scheduling problems
• On a stochastic sequencing and scheduling problem
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• Generating cuts in integer programming with families of special ordered sets

This page was built for publication: S3 sets. An extension of the Beale-Tomlin special ordered sets

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