An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866)
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: An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem |
scientific article; zbMATH DE number 6331177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem |
scientific article; zbMATH DE number 6331177 |
Statements
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (English)
0 references
18 August 2014
0 references
just-in-time scheduling
0 references
flow shop
0 references
complexity
0 references
pseudo-polynomial algorithm
0 references
FPTAS
0 references
