An algorithm for single machine sequencing with release dates to minimize total weighted completion time (Q1171502): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On n/1/?? dynamic deterministic problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3217922 / 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: Q4124328 / rank | |||
Normal rank | |||
Latest revision as of 17:24, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for single machine sequencing with release dates to minimize total weighted completion time |
scientific article |
Statements
An algorithm for single machine sequencing with release dates to minimize total weighted completion time (English)
0 references
1983
0 references
sequencing with release dates
0 references
minimization of overall completion time
0 references
heuristic algorithm
0 references
n jobs
0 references
single machine
0 references
weighted completion times
0 references
branch and bound algorithm
0 references
Lagrangean relaxation
0 references
computational results
0 references
0 references
