Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161)
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: Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives |
scientific article; zbMATH DE number 7798676
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives |
scientific article; zbMATH DE number 7798676 |
Statements
Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (English)
0 references
2 February 2024
0 references
two-agent scheduling
0 references
unbounded serial-batch
0 references
compatibility/incompatibility
0 references
batch/item availability
0 references
maximum lateness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
