On the existence of schedules that are near-optimal for both makespan and total weighted completion time
From MaRDI portal
Publication:1375117
DOI10.1016/S0167-6377(97)00025-4zbMath0888.90095OpenAlexW2087746279MaRDI QIDQ1375117
Publication date: 12 January 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00025-4
Related Items (24)
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness ⋮ A note on scheduling to meet two min-sum objectives ⋮ Bicriteria approximation algorithms for scheduling problems with communications delays ⋮ An almost tight lower bound for the scheduling problem to meet two min-sum objectives ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Fair online load balancing ⋮ Multi-criteria scheduling: an agent-based approach for expert knowledge integration ⋮ Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ An improved lower bound for a bi-criteria scheduling problem ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ How good are SPT schedules for fair optimality criteria ⋮ Covers and approximations in multiobjective optimization ⋮ Bi-objective matchings with the triangle inequality ⋮ The constrained minimum weighted sum of job completion times problem ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Approximation algorithms for the bi-criteria weighted MAX-CUT problem ⋮ Bi-objective cell loading problem with non-zero setup times with fuzzy aspiration levels in labour intensive manufacturing cells ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ Multicriteria scheduling ⋮ Fairness in parallel job scheduling ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ Approximate tradeoffs on weighted labeled matroids ⋮ A new approach for bicriteria partitioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Solving a bicriterion scheduling problem
- An approximation algorithm for the generalized assignment problem
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- The minimum latency problem
- The complexity of the travelling repairman problem
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling independent tasks to reduce mean finishing time
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Bounds for Certain Multiprocessing Anomalies
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
