Pages that link to "Item:Q4632843"
From MaRDI portal
The following pages link to Improved bounds for batch scheduling with nonidentical job sizes (Q4632843):
Displaying 12 items.
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms (Q1735170) (← links)
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities (Q1800447) (← links)
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery (Q2039713) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
- Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
