Pages that link to "Item:Q1273116"
From MaRDI portal
The following pages link to Batch scheduling with deadlines on parallel machines (Q1273116):
Displaying 13 items.
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem (Q4634982) (← links)
