A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:55, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for an integer quadratic non-separable transportation problem |
scientific article |
Statements
A polynomial algorithm for an integer quadratic non-separable transportation problem (English)
0 references
16 January 1993
0 references
A polynomial algorithm for the problem of minimizing the total weighted tardiness when scheduling jobs on a single machine in the presence of large sets of identical jobs is presented. The problem is formulated as an integer problem with quadratic objective function and transportation constraints.
0 references
polynomial algorithm
0 references
total weighted tardiness
0 references
single machine
0 references
large sets of identical jobs
0 references
quadratic objective function
0 references
transportation constraints
0 references
