Optimal on-line algorithms for one batch machine with grouped processing times (Q411231): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6021866 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
batching | |||
| Property / zbMATH Keywords: batching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
on-line algorithm | |||
| Property / zbMATH Keywords: on-line algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
delivery time | |||
| Property / zbMATH Keywords: delivery time / rank | |||
Normal rank | |||
Revision as of 19:35, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal on-line algorithms for one batch machine with grouped processing times |
scientific article |
Statements
Optimal on-line algorithms for one batch machine with grouped processing times (English)
0 references
4 April 2012
0 references
batching
0 references
scheduling
0 references
on-line algorithm
0 references
delivery time
0 references
