Some simple scheduling algorithms
From MaRDI portal
Publication:4401712
DOI10.1002/nav.3800210113zbMath0276.90024OpenAlexW1980289219MaRDI QIDQ4401712
Publication date: 1974
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800210113
Related Items
Integrated production and outbound distribution scheduling problems with job release dates and deadlines, Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last, Scheduling jobs to minimize total cost, Complexity of scheduling tasks with time-dependent execution times, Energetic reasoning revisited: Application to parallel machine scheduling, One machine scheduling problem with fuzzy duedates, A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization, Nearly on line scheduling of preemptive independent tasks, Efficient algorithms for scheduling parallel jobs with interval constraints in clouds, Parallel machine scheduling with machine availability and eligibility constraints, On scheduling garbage collector in dynamic real-time systems with statistical timing assurances, Variants of Multi-resource Scheduling Problems with Equal Processing Times, An effective lower bound on \(L_{\max}\) in a worker-constrained job shop, An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization, The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays, Scheduling imprecise computation tasks with \(0/1\)-constraint, Proportionate progress: A notion of fairness in resource allocation, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Pre-emptive scheduling problems with controllable processing times, Scheduling parallel jobs to minimize the makespan, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines, A parametric maximum flow algorithm for bipartite graphs with applications, A procedure for the one-machine sequencing problem with dependent jobs, Fleet and charging infrastructure decisions for fast-charging city electric bus service, Improving the preemptive bound for the single machine dynamic maximum lateness problem, An improved algorithm for online machine minimization, Erratum to: ``Minimizing total tardiness on parallel machines with preemptions, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, A particular timetable problem: terminal scheduling, Fast solution of single-machine scheduling problem with embedded jobs, Open shop problems with unit time operations, A survey of due-date related single-machine with two-agent scheduling problem, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Competitive two-agent scheduling with release dates and preemption on a single machine, Minimizing total completion time for preemptive scheduling with release dates and deadline constraints, Scheduling periodically occurring tasks on multiple processors, Min-max relative regret for scheduling to minimize maximum lateness, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, Vyacheslav Tanaev: contributions to scheduling and related areas, Preemptive scheduling to minimize mean weighted flow time, Preemptive scheduling of independent jobs with release times and deadlines on a hypercube, A state-of-the-art review of parallel-machine scheduling research, Dynamic speed scaling minimizing expected energy consumption for real-time tasks, Scheduling open shops with parallel machines, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Scheduling with limited machine availability, On the complexity of generalized due date scheduling problems, Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines, Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, Meeting Deadlines: How Much Speed Suffices?, Minimizing maximum lateness on one machine: computational experience and some applications, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Task assignment algorithms for two-type heterogeneous multiprocessors, Feasibility analysis of sporadic real-time multiprocessor task systems, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, Stochastic scheduling to minimize expected maximum lateness, A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines., A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Preemptive scheduling with simple linear deterioration on a single machine, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, Optimal parallel machines scheduling with availability constraints, New applications of the Muntz and Coffman algorithm, A computational study of the permutation flow shop problem based on a tight lower bound, Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible, A particular timetable problem: Terminal scheduling, Minimizing mean weighted execution time loss on identical and uniform processors, Jackson's semi-preemptive scheduling on a single machine, Scheduling jobs with release and delivery times subject to nested eligibility constraints, Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines, About one algorithm for solving scheduling problem, A fast bipartite network flow algorithm for selective assembly, A survey of scheduling with parallel batch (p-batch) processing, Single machine scheduling subject to precedence delays, Effective optimization methods for single-machine scheduling (survey), A survey of real-time scheduling on multiprocessor systems, An algorithm for selecting the execution intensity of jobs in a schedule, Scheduling with target times, Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness, 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem, The power of \(\alpha\)-points in preemptive single machine scheduling., Scheduling periodic tasks on uniform multiprocessors, Scheduling with job release dates, delivery times and preemption penalties, Mathematical programming formulations for machine scheduling: A survey, Minimizing makespan on parallel machines subject to release dates and delivery times, An optimal scheduling algorithm for preemptable real-time tasks, An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines, A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
