Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4147880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming approach to the single-machine sequencing problem with different due-dates |
scientific article; zbMATH DE number 4147880 |
Statements
Dynamic programming approach to the single-machine sequencing problem with different due-dates (English)
0 references
1990
0 references
A collection of jobs is to be processed in such a way that the sum of absolute deviations of job completion times about their respective due- dates is minimized. The problem is NP-complete and a dynamic programming approach is described which offers considerable computational savings over complete enumeration.
0 references
sum of absolute deviations
0 references
job completion times
0 references
due-dates
0 references
NP-complete
0 references
0 references
0.8523609638214111
0 references
0.8523609638214111
0 references
0.8360128998756409
0 references
0.8210471868515015
0 references
