S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Global optimization using special ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maintenance scheduling of production units / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686494 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Codes for Problems of Integer Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3940839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank | |||
Normal rank |
Latest revision as of 17:17, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | S3 sets. An extension of the Beale-Tomlin special ordered sets |
scientific article |
Statements
S3 sets. An extension of the Beale-Tomlin special ordered sets (English)
0 references
1988
0 references
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.
0 references
special ordered sets
0 references
additional exclusivity constraints
0 references
precedence relationsships
0 references