Pages that link to "Item:Q4769981"
From MaRDI portal
The following pages link to Scheduling independent tasks to reduce mean finishing time (Q4769981):
Displayed 50 items.
- Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (Q336513) (← links)
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Competitive routing over time (Q719282) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Scheduling problems with a weight-modifying-activity (Q828829) (← links)
- Scheduling for stability in single-machine production systems (Q835553) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- Preemptive scheduling to minimize mean weighted flow time (Q910208) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Worst-case analysis of a scheduling algorithm (Q1060946) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- Weighted flow time bounds for scheduling identical processors (Q1129956) (← links)
- Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
- NP-complete scheduling problems (Q1220386) (← links)
- On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
- Optimal scheduling of homogeneous job systems (Q1236493) (← links)
- A graph model for scheduling processes in systems with parallel computations (Q1238748) (← links)
- A general lower bound for the makespan problem (Q1266724) (← links)
- Single machine scheduling with batch deliveries (Q1278307) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Two-machine shop scheduling with zero and unit processing times (Q1296097) (← links)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
- Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← links)
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
- Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- The complexity of scheduling job families about a common due date (Q1376265) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)