Some simple scheduling algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Scheduling imprecise computation tasks with \(0/1\)-constraint
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- On the complexity of nurse rostering problems
- Algorithms for scheduling deadline-sensitive malleable tasks
- Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
- Parallel machine scheduling with machine availability and eligibility constraints
- Comparison of three classical lower bounds for the parallel machines scheduling problem
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- An optimal scheduling algorithm for preemptable real-time tasks
- Minimizing maximum lateness on one machine: computational experience and some applications
- Meeting deadlines: how much speed suffices?
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- Fleet and charging infrastructure decisions for fast-charging city electric bus service
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
- Dynamic speed scaling minimizing expected energy consumption for real-time tasks
- Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
- A fast bipartite network flow algorithm for selective assembly
- One machine scheduling problem with fuzzy duedates
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- A survey of due-date related single-machine with two-agent scheduling problem
- A state-of-the-art review of parallel-machine scheduling research
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Jackson's semi-preemptive scheduling on a single machine
- A survey of real-time scheduling on multiprocessor systems
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing mean weighted execution time loss on identical and uniform processors
- Nearly on line scheduling of preemptive independent tasks
- Energetic reasoning revisited: Application to parallel machine scheduling
- Scheduling periodically occurring tasks on multiple processors
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- Optimal parallel machines scheduling with availability constraints
- An O( m)-competitive algorithm for online machine minimization
- Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
- Task assignment algorithms for two-type heterogeneous multiprocessors
- On scheduling garbage collector in dynamic real-time systems with statistical timing assurances
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Preemptive scheduling to minimize mean weighted flow time
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- Stochastic scheduling to minimize expected maximum lateness
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption
- Improving the preemptive bound for the single machine dynamic maximum lateness problem
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- About one algorithm for solving scheduling problem
- On the complexity of generalized due date scheduling problems
- New applications of the Muntz and Coffman algorithm
- An improved algorithm for online machine minimization
- Complexity of scheduling tasks with time-dependent execution times
- Proportionate progress: A notion of fairness in resource allocation
- A procedure for the one-machine sequencing problem with dependent jobs
- Single machine scheduling subject to precedence delays
- Scheduling with limited machine availability
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Scheduling periodic tasks on uniform multiprocessors
- Scheduling with job release dates, delivery times and preemption penalties
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
- A particular timetable problem: Terminal scheduling
- Scheduling jobs to minimize total cost
- Scheduling parallel jobs to minimize the makespan
- A computational study of the permutation flow shop problem based on a tight lower bound
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- An algorithm for selecting the execution intensity of jobs in a schedule
- Scheduling with target times
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
- Pre-emptive scheduling problems with controllable processing times
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Min-max relative regret for scheduling to minimize maximum lateness
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- Effective optimization methods for single-machine scheduling (survey)
- Fifty years of research in scheduling -- theory and applications
- Min-max relative regret for scheduling to minimize maximum lateness
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Preemptive scheduling with simple linear deterioration on a single machine
- Scheduling open shops with parallel machines
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Fast solution of single-machine scheduling problem with embedded jobs
- A survey of scheduling with parallel batch (p-batch) processing
- A particular timetable problem: terminal scheduling
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- A parametric maximum flow algorithm for bipartite graphs with applications
- Open shop problems with unit time operations
This page was built for publication: Some simple scheduling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401712)
