The one-machine sequencing problem (Q1162927): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequencing with due-dates and early start times to minimize maximum tardiness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4170510 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5650538 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:25, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The one-machine sequencing problem |
scientific article |
Statements
The one-machine sequencing problem (English)
0 references
1982
0 references
one-machine sequencing
0 references
efficient branch and bound methods
0 references
tree-search
0 references
Schrage schedule
0 references
minimization of makespan
0 references
NP-hardness
0 references
computational complexity
0 references
0 references