Pages that link to "Item:Q4769981"
From MaRDI portal
The following pages link to Scheduling independent tasks to reduce mean finishing time (Q4769981):
Displaying 50 items.
- 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)
- Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- Shapley value for parallel machine sequencing situation without initial order (Q1665679) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Project scheduling under uncertainty: survey and research potentials (Q1772834) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
- Lower bounds on precedence-constrained scheduling for parallel processors. (Q1853033) (← links)
- Optimized extrapolation methods for parallel solution of IVPs on different computer architectures (Q1918323) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Scheduling parallel jobs using migration and consolidation in the cloud (Q1955088) (← links)
- Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption (Q2203586) (← links)
- Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (Q2321315) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- Green scheduling, flows and matchings (Q2344761) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)