On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

DOI10.1016/S0304-3975(03)00288-3zbMath1059.68012MaRDI QIDQ1426457

Eric Angel, Evripidis Bampis, Alexander V. Kononov

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

SchedulingMulticriteria optimizationPolynomial time approximation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (14)

A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints ⋮ Covers and approximations in multiobjective optimization ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ Bi-objective cell loading problem with non-zero setup times with fuzzy aspiration levels in labour intensive manufacturing cells ⋮ One-exact approximate Pareto sets ⋮ Implementing an efficient fptas for the 0-1 multi-objective knapsack problem ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling a batching machine
• An approximation algorithm for the generalized assignment problem
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Finding the Pareto-optima for the total and maximum tardiness single machine problem
• Multicriteria scheduling problems: a survey
• Improved approximation schemes for scheduling unrelated parallel machines
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Scheduling independent tasks to reduce mean finishing time
• On approximating a scheduling problem

This page was built for publication: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.