Pages that link to "Item:Q1417850"
From MaRDI portal
The following pages link to Approximation algorithms in batch processing (Q1417850):
Displayed 7 items.
- Semi-online scheduling: a survey (Q2669808) (← links)
- Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines (Q2931174) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE (Q3397511) (← links)
- An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917) (← links)
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)