An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (Q1170111): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Chris N. Potts / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Luk N. Van Wassenhove / rank | |||
Normal rank | |||
Revision as of 07:39, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for single machine sequencing with deadlines to minimize total weighted completion time |
scientific article |
Statements
An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (English)
0 references
1983
0 references
single machine sequencing
0 references
deadlines
0 references
minimization of total weighted completion time
0 references
n jobs
0 references
branch and bound algorithm
0 references
lower bounds
0 references
multiplier adjustment method
0 references
dominance conditions
0 references
heuristic
0 references
Lagrangean relaxation
0 references
optimal solution
0 references
processing without interruption
0 references
computational experience
0 references
