Pages that link to "Item:Q4272903"
From MaRDI portal
The following pages link to On the Minimization of the Makespan Subject to Flowtime Optimality (Q4272903):
Displaying 27 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Notes on a hierarchical scheduling problem on identical machines (Q506158) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan (Q1711478) (← links)
- Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
- A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan (Q1868959) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
- Minimizing makespan and throughput times at Aalsmeer flower auction (Q3545655) (← links)
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem (Q3635001) (← links)
- Minimizing makespan in parallel flowshops (Q4356676) (← links)
- Makespan minimization for \(m\) parallel identical processors (Q4865763) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)