Pages that link to "Item:Q930610"
From MaRDI portal
The following pages link to Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610):
Displaying 11 items.
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)
