A note on graph balancing problems with restrictions
type: Item
instance of: scholarly article
title: A note on graph balancing problems with restrictions
zbMATH Open document ID: 1197.05147
author: Kangbok Lee
author: Joseph Y.-T. Leung
author: Michael L. Pinedo
published in: Information Processing Letters
publication date: 2010-09-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5778941
zbMATH Keywords: approximation algorithm
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
zbMATH Keywords: graph balancing
zbMATH Keywords: parallel machines scheduling
zbMATH Keywords: eligibility constraints
zbMATH Keywords: fully polynomial time approximation scheme
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.09.015
OpenAlex ID: W2066813640
cites work: GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
cites work: Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
cites work: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
cites work: Q3619797
cites work: Q3579372
cites work: Q4198056
cites work: Parallel machine scheduling with job assignment restrictions
cites work: Algorithms and Data Structures
cites work: Parallel machine scheduling under a grade of service provision
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Parallel machine scheduling of machine-dependent jobs with unit-length.
cites work: Scheduling parallel machines with inclusive processing set restrictions
cites work: Q3525911
cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
DOI: 10.1016/J.IPL.2009.09.015
description: scientific article; zbMATH DE number 5778941