Pages that link to "Item:Q2905284"
From MaRDI portal
The following pages link to APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284):
Displaying 13 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Scheduling parallel jobs on heterogeneous platforms (Q510901) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (Q3297564) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
- Algorithms for scheduling deadline-sensitive malleable tasks (Q6559486) (← links)
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)
