On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
type: Item
instance of: scholarly article
title: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
zbMATH Open document ID: 1059.68012
DOI: 10.1016/S0304-3975(03)00288-3
author: Eric Angel
author: Evripidis Bampis
author: Alexander Kononov
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2056803
zbMATH Keywords: Multicriteria optimization
zbMATH Keywords: Polynomial time approximation
zbMATH Keywords: Scheduling
MaRDI profile type: Publication
cites work: Q4796176
cites work: Q4252370
cites work: Scheduling a batching machine
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4247460
cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
cites work: On approximating a scheduling problem
cites work: Q4778556
cites work: Q3888874
cites work: Q4002567
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Improved approximation schemes for scheduling unrelated parallel machines
cites work: Q4142699
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: An approximation algorithm for the generalized assignment problem
cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem
cites work: Multicriteria scheduling problems: a survey
cites work: Q4252365
description: scientific article; zbMATH DE number 2056803