Technical Note—Minimizing Average Flow Time with Parallel Machines
From MaRDI portal
Publication:5675148
DOI10.1287/opre.21.3.846zbMath0259.90030OpenAlexW2111874279MaRDI QIDQ5675148
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.3.846
Related Items
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, Multitasking via alternate and shared processing: algorithms and complexity, Optimal due date assignment in multi-machine scheduling environments, Task scheduling in networks, Scheduling jobs that arrive over time, Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times, Discrete convexity in joint winner property, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, On computing an optimal semi-matching, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Serial batch scheduling on uniform parallel machines to minimize total completion time, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods, Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, Scheduling unrelated parallel machines to minimize total weighted tardiness., Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems, Hybrid tractability of valued constraint problems, A state-of-the-art review of parallel-machine scheduling research, A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, 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, 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, Using quadratic programming to solve high multiplicity scheduling problems on parallel machines, Approximability of average completion time scheduling on unrelated machines, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines, Robust algorithms for total completion time, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Multipurpose machine scheduling with rejection and identical job processing times, Approximation algorithms for multi-agent scheduling to minimize total weighted completion time, Ideal schedules in parallel machine settings, Faster Algorithms for Semi-Matching Problems, TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS, Scheduling equal length jobs with eligibility restrictions, Decentralized utilitarian mechanisms for scheduling games, Polynomial time approximation algorithms for machine scheduling: Ten open problems, A note: Simple heuristics for scheduling a maintenance activity on unrelated machines, Single machine scheduling with batch deliveries, Scheduling meets \(n\)-fold integer programming, On Computing an Optimal Semi-matching, Exact and approximate algorithms for high-multiplicity parallel machine scheduling, Minimizing average completion time in the presence of release dates, Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times, Multicriteria scheduling, Scheduling unit length jobs with parallel nested machine processing set restrictions, A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines, A PTAS for the average weighted completion time problem on unrelated machines., An approximation algorithm for the generalized assignment problem, Performance guarantees of local search for minsum scheduling problems
