Scheduling independent tasks to reduce mean finishing time
From MaRDI portal
Publication:4769981
DOI10.1145/361011.361064zbMath0283.68039OpenAlexW2031612682MaRDI QIDQ4769981
Ravi Sethi, Edward G. jun. Coffman, John L. Bruno
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361011.361064
Related Items
Scheduling problems with a weight-modifying-activity, Minimizing mean flow time with parallel processors and resource constraints, Scheduling chains to minimize mean flow time, Scheduling for stability in single-machine production systems, Optimal due date assignment in multi-machine scheduling environments, Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems, Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms, An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization, Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times, Discrete convexity in joint winner property, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times, Shapley value for parallel machine sequencing situation without initial order, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, The complexity of scheduling job families about a common due date, Optimized extrapolation methods for parallel solution of IVPs on different computer architectures, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, On computing an optimal semi-matching, Weighted flow time bounds for scheduling identical processors, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Minimizing the total weighted completion time of fully parallel jobs with integer parallel units, Is a unit-job shop not easier than identical parallel machines?, Serial batch scheduling on uniform parallel machines to minimize total completion time, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption, Preemptive scheduling to minimize mean weighted flow time, Scheduling unrelated parallel machines to minimize total weighted tardiness., Scheduling parallel jobs using migration and consolidation in the cloud, Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, Hybrid tractability of valued constraint problems, A note on minimizing the sum of quadratic completion times on two identical parallel machines, A state-of-the-art review of parallel-machine scheduling research, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems., Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem, Equivalence of mean flow time problems and mean absolute deviation problems, Scheduling results applicable to decision-theoretic troubleshooting, Frameworks for adaptable scheduling algorithms, Lower bounds and algorithms for flowtime minimization on a single machine with set-up times, Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion, Scheduling multiprocessor tasks for mean flow time criterion, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, Scheduling problem with multi-purpose parallel machines, A study of scheduling problems with preemptions on multi-core computers with GPU accelerators, Using quadratic programming to solve high multiplicity scheduling problems on parallel machines, Approximability of average completion time scheduling on unrelated machines, Finding efficient make-to-order production and batch delivery schedules, A scheduling problem with job values given as a power function of their completion times, A new dynamic programming algorithm for the parallel machines total weighted completion time problem, An algorithm for flow time minimization and its asymptotic makespan properties, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, Minimization of ordered, symmetric half-products, Robust algorithms for total completion time, NP-complete scheduling problems, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Project scheduling under uncertainty: survey and research potentials, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Heuristic methods for the identical parallel machine flowtime problem with set-up times, On batch scheduling of jobs with stochastic service times and cost structures on a single server, Competitive routing over time, Optimal scheduling of homogeneous job systems, Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing, A graph model for scheduling processes in systems with parallel computations, Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, Ideal schedules in parallel machine settings, Improved approximation algorithms for two-stage flowshops scheduling problem, Scheduling equal length jobs with eligibility restrictions, Polynomial time approximation algorithms for machine scheduling: Ten open problems, On the minimization of total weighted flow time with identical and uniform parallel machines, Preemptive scheduling on identical parallel machines subject to deadlines., A general lower bound for the makespan problem, Scheduling chain-structured tasks to minimize makespan and mean flow time, Single machine scheduling with batch deliveries, Scheduling meets \(n\)-fold integer programming, Scheduling fully parallel jobs, Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem, Minimizing average completion time in the presence of release dates, Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times, Two-machine shop scheduling with zero and unit processing times, Fairness in parallel job scheduling, A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines, Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time, A PTAS for the average weighted completion time problem on unrelated machines., Lower bounds on precedence-constrained scheduling for parallel processors., Split scheduling with uniform setup times, A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems, Two parallel machine sequencing problems involving controllable job processing times, Worst-case analysis of a scheduling algorithm, Green scheduling, flows and matchings, Fair by design: multidimensional envy-free mechanisms, A survey of the state-of-the-art of common due date assignment and scheduling research, Bounds and asymptotic results for the uniform parallel processor weighted flow time problem, Scheduling identical parallel machines to minimize total weighted completion time, An approximation algorithm for the generalized assignment problem, Mathematical programming formulations for machine scheduling: A survey, New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria, Performance guarantees of local search for minsum scheduling problems, Scheduling on parallel machines considering job-machine dependency constraints, Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times, Task scheduling in networks, Scheduling jobs that arrive over time, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, Maximizing set function formulation of two scheduling problems, Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines, Unrelated parallel machine scheduling with new criteria: complexity and models, Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds, Scheduling two-stage jobs on multiple flowshops, A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, A historical note on the complexity of scheduling problems, On the complexity of scheduling problems with a fixed number of parallel identical machines, Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods, Unnamed Item, An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime, Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems, Local Monotonicity in Probabilistic Networks, Approximating the least core value and least core of cooperative games with supermodular costs, Scheduling Fully Parallel Jobs with Integer Parallel Units, A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Exponential neighborhood search for a parallel machine scheduling problem, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems, Dynamic programming algorithms for scheduling parallel machines with family setup times, Scheduling a single batch processing machine with non-identical job sizes, A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines, The complexity of machine scheduling for stability with a single disrupted job, Minimizing flowtime subject to optimal makespan on two identical parallel machines, A note on weighted completion time minimization in a flexible flow shop, Job scheduling in multiprogrammed computer systems, Faster Algorithms for Semi-Matching Problems, Decentralized utilitarian mechanisms for scheduling games, NP-Complete operations research problems and approximation algorithms, On Computing an Optimal Semi-matching, Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories, Scheduling jobs to two machines subject to batch arrival ordering
