Pages that link to "Item:Q880501"
From MaRDI portal
The following pages link to Pre-emptive scheduling problems with controllable processing times (Q880501):
Displaying 18 items.
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)