Improved lower bounds for the early/tardy scheduling problem with no idle time (Q5464436)
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: Improved lower bounds for the early/tardy scheduling problem with no idle time |
scientific article; zbMATH DE number 2195463
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved lower bounds for the early/tardy scheduling problem with no idle time |
scientific article; zbMATH DE number 2195463 |
Statements
Improved lower bounds for the early/tardy scheduling problem with no idle time (English)
0 references
17 August 2005
0 references
sequencing
0 references
early/tardy
0 references
lower bound
0 references