Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531)
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: Online scheduling of two-machine flowshop with lookahead and incompatible job families |
scientific article; zbMATH DE number 7642706
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online scheduling of two-machine flowshop with lookahead and incompatible job families |
scientific article; zbMATH DE number 7642706 |
Statements
Online scheduling of two-machine flowshop with lookahead and incompatible job families (English)
0 references
17 January 2023
0 references
online algorithm
0 references
lookahead interval
0 references
incompatible job families
0 references
parallel-batch scheduling
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
0 references
0 references
