On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
From MaRDI portal
Publication:4170215
Cited in
(80)- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- An improved approximation algorithm for the partial Latin square extension problem.
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Scheduling unit-time jobs on processors with different capabilities
- Makespan minimization in online scheduling with machine eligibility
- Scheduling with tails and deadlines
- Data transfers in networks
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- A unified view of parallel machine scheduling with interdependent processing rates
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Scheduling algorithms for procrastinators
- Incorporating the strength of MIP modeling in schedule construction
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- Approximation algorithms for general parallel task scheduling
- On the complexity of preemptive openshop scheduling problems
- A state-of-the-art review of parallel-machine scheduling research
- Restricted assignment scheduling with resource constraints
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing mean weighted execution time loss on identical and uniform processors
- On preemptive scheduling: A general setting for the two-phase method
- Scheduling periodically occurring tasks on multiple processors
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- A decomposition property of polyhedra
- Two-machine open shop scheduling with an availability constraint
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Minimizing the stretch when scheduling flows of divisible requests
- Ideal schedules in parallel machine settings
- Stochastic scheduling to minimize expected maximum lateness
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption
- Preemptive scheduling on uniform machines to minimize mean flow time
- Preemptive Scheduling, Linear Programming and Network Flows
- On the complexity of generalized due date scheduling problems
- Scheduling multilayer divisible computations
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Robust algorithms for preemptive scheduling
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Preemptive scheduling with staircase and piecewise linear resource availability
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
- On the complexity of constructing multiprocessor little-preemptive schedules
- Schedules with a single preemption on uniform parallel machines
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- On the max-weight edge coloring problem
- Parallel machine problems with equal processing times: a survey
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- The battery switching station scheduling problem
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Parallel machine scheduling with splitting jobs
- Integrality Property in Preemptive Parallel Machine Scheduling
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- On the configuration-LP for scheduling on unrelated machines
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Effective optimization methods for single-machine scheduling (survey)
- Power of preemption for minimizing total completion time on uniform parallel machines
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Preemptive scheduling algorithms with nested processing set restriction
- Scheduling open shops with parallel machines
- Multicriteria scheduling
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Approximability of average completion time scheduling on unrelated machines
- Makespan minimization in online scheduling with machine eligibility
- Taming tail latency in key-value stores: a scheduling perspective
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
- Optimal algorithms and a PTAS for cost-aware scheduling
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Minimizing the number of late jobs on unrelated machines
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
- Optimal algorithms for scheduling under time-of-use tariffs
This page was built for publication: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170215)
