Pages that link to "Item:Q4769981"
From MaRDI portal
The following pages link to Scheduling independent tasks to reduce mean finishing time (Q4769981):
Displaying 37 items.
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
- The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Scheduling on parallel machines considering job-machine dependency constraints (Q2883591) (← links)
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
- Scheduling Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
- On Computing an Optimal Semi-matching (Q3104781) (← links)
- Local Monotonicity in Probabilistic Networks (Q3524964) (← links)
- Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories (Q3680272) (← links)
- An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (Q3783064) (← links)
- Scheduling jobs to two machines subject to batch arrival ordering (Q3960455) (← links)
- Maximizing set function formulation of two scheduling problems (Q4015963) (← links)
- Job scheduling in multiprogrammed computer systems (Q4167577) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
- Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems (Q4609785) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)
- (Q5009585) (← links)
- Task scheduling in networks (Q5054769) (← links)
- Scheduling jobs that arrive over time (Q5057424) (← links)
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds (Q5101424) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Dynamic programming algorithms for scheduling parallel machines with family setup times (Q5926032) (← links)
- A note on weighted completion time minimization in a flexible flow shop (Q5949902) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
- A historical note on the complexity of scheduling problems (Q6161270) (← links)
- On the complexity of scheduling problems with a fixed number of parallel identical machines (Q6169524) (← links)