Applying new dominance concepts to job schedule optimization (Q1162922): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Characterizing the set of feasible sequences for n jobs to be carried out on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank | |||
Normal rank | |||
Revision as of 15:25, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying new dominance concepts to job schedule optimization |
scientific article |
Statements
Applying new dominance concepts to job schedule optimization (English)
0 references
1982
0 references
scheduling of independent jobs
0 references
single machine
0 references
dominance concept
0 references
branch and bound procedure
0 references
computational experiments
0 references
minimization of total elapsed time
0 references
