Technical Note—Minimizing Average Flow Time with Parallel Machines
From MaRDI portal
Cited in
(56)- A note: Simple heuristics for scheduling a maintenance activity on unrelated machines
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Single machine scheduling with batch deliveries
- Minimizing average completion time in the presence of release dates
- An approximation algorithm for the generalized assignment problem
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- A PTAS for the average weighted completion time problem on unrelated machines.
- Discrete convexity in joint winner property
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Robust algorithms for total completion time
- Multipurpose machine scheduling with rejection and identical job processing times
- Ideal schedules in parallel machine settings
- Performance guarantees of local search for minsum scheduling problems
- Scheduling equal length jobs with eligibility restrictions
- Scheduling meets n-fold integer programming
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- On computing an optimal semi-matching
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Decentralized utilitarian mechanisms for scheduling games
- Multicriteria scheduling
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Faster algorithms for semi-matching problems
- Multitasking via alternate and shared processing: algorithms and complexity
- Scheduling on parallel machines considering job-machine dependency constraints
- Power of preemption for minimizing total completion time on uniform parallel machines
- Two-stage flowshop scheduling problems with identical and batch processors
- On computing an optimal semi-matching
- Serial batch scheduling on uniform parallel machines to minimize total completion time
- Analysis and experimental study of heuristics for job scheduling reoptimization problems
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Scheduling problem with multi-purpose parallel machines
- Task scheduling in networks
- Scheduling jobs that arrive over time
- Approximability of average completion time scheduling on unrelated machines
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Hybrid tractability of valued constraint problems
- Improved bounds for distributed load balancing
- Minimizing total completion time with machine-dependent priority lists
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Title not available (Why is no real title available?)
- Optimal due date assignment in multi-machine scheduling environments
- A state-of-the-art review of parallel-machine scheduling research
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
This page was built for publication: Technical Note—Minimizing Average Flow Time with Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675148)
