Pages that link to "Item:Q3859548"
From MaRDI portal
The following pages link to Preemptive Scheduling with Due Dates (Q3859548):
Displayed 21 items.
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (Q917300) (← links)
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- The selection and scheduling of textile orders with due dates (Q1263516) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- The battery switching station scheduling problem (Q1939710) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Stochastic scheduling to minimize expected maximum lateness (Q2482822) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Scheduling on semi-identical processors (Q3343751) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- A PC-based production scheduling system using a mixed integer programming approach (Q4394272) (← links)
- Scheduling Models: Shibboleth and Operating Characteristics (Q4747900) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)