An Approximation Result for a Duo-Processor Task Scheduling Problem

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Information Processing Letters

• Publication date

  1997-02-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0020-0190(96)00196-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Comparability Graph Augmentation for some Multiprocessor Scheduling Problems

  1997cited by this paper
• Efficiency and effectiveness of normal schedules on three dedicated processors

  1997cited by this paper
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations

  1994cited by this paper
• The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors

  1987cited by this paper
• An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

  1985cited by this paper
• Scheduling file transfers in a distributed network

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Scheduling Problems with a Singular Solution

  1982cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper

• Inventory routing problems: an introduction

  2012cites this paper
• Subjective measures of quality of work in the italian social cooperatives

  2008cites this paper
• A survey on task scheduling for heterogeneous parallel computing environments

  2007cites this paper
• Graph models for scheduling systems with machine saturation property

  2006cites this paper
• Complexity and approximation results for scheduling multiprocessor tasks on a ring

  2003cites this paper
• An approximation result for the interval coloring problem on claw-free chordal graphs

  2002cites this paper
• Using Rejection Methods in a DSS for Production Strategies

  2002cites this paper
• An approximation result for a periodic allocation problem

  2001cites this paper
• Partitioning Cliques of Claw-free Strongly Chordal Graphs

  1999cites this paper
• Graph Models for a Duo-Processor Task Scheduling Problem

  1997cites this paper