On minimizing total tardiness in a serial batching problem (Q2765603)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On minimizing total tardiness in a serial batching problem |
scientific article; zbMATH DE number 1694889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimizing total tardiness in a serial batching problem |
scientific article; zbMATH DE number 1694889 |
Statements
25 August 2002
0 references
pseudopolynomial algorithm
0 references
dynamic programming
0 references
scheduling of jobs
0 references
total tardiness
0 references
On minimizing total tardiness in a serial batching problem (English)
0 references
The article presents a pseudopolynomial algorithm for a scheduling jobs on a serial batching machine minimizing total tardiness (the problem is NP-hard in the ordinary sense). The method used by the algorithm is dynamic programming.
0 references
