✦ LIBER ✦

Approximation of the supply scheduling problem

✍ Scribed by Satyaveer S. Chauhan; Anton V. Eremeev; Anna A. Romanova; Vladimir V. Servakh; Gerhard J. Woeginger

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 172 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.04.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximability of an interval sc

On the approximability of an interval scheduling problem

✍ Frits C. R. Spieksma 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 148 KB 👁 2 views

In this paper we consider a general interval scheduling problem. The problem is a natural generalization of "nding a maximum independent set in an interval graph. We show that, unless P"NP, this maximization problem cannot be approximated in polynomial time within arbitrarily good precision. On the

A parallel approximation scheme for the

A parallel approximation scheme for the multiprocessor scheduling problem

✍ Ricardo C. Corrêa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 433 KB

In this paper, a parallel branch-and-bound approach for ®nding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ®nd solutions to the subproblems enumerated during the

On polynomial-time approximation algorit

On polynomial-time approximation algorithms for the variable length scheduling problem

✍ Artur Czumaj; Leszek Ga̧sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ÿrst discuss a

An approximation result for a duo-proces

An approximation result for a duo-processor task scheduling problem

✍ P. Dell'Olmo; S. Giordani; M.G. Speranza 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 479 KB

We consider the problem of scheduling tasks on a set of dedicated processors, where each task requires a subset of two processors be simultaneously available for a given processing time. The objective is to determine a nonpreemptive schedule with minimum completion time. By means of a graph theoreti

An approximation algorithm for the prece

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications

✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary

The problem of coal supply

✍ Edward W Parker 📂 Article 📅 1918 🏛 Elsevier Science 🌐 English ⚖ 863 KB

THE subject assigned to me for discussion this evening by your secretary, and my friend, Doctor Owens, " The Problem of Coal Supply," is somewhat misleading, for I think I shall be able to show in a very few words at the outset that the problem in our fuel troubles is not one of supply but of produc