✦ LIBER ✦

A note on the generalized due dates scheduling problems

✍ Scribed by C. Sriskandarajah

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 487 KB
Volume: 37
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199008)37:4<587::aid-nav3220370411>3.0.co;2-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling to a common due date on paral

Scheduling to a common due date on parallel uniform processors

✍ Hamilton Emmons 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB 👁 1 views

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

A note on the blasius problem for viscoe

A note on the blasius problem for viscoelastic fluids

✍ R. W. Serth 📂 Article 📅 1973 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 289 KB 👁 2 views

A note on the normwise perturbation theo

A note on the normwise perturbation theory for the regular generalized eigenproblem

✍ Valérie Frayssé; Vincent Toumazou 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

In this paper, we present a normwise perturbation theory for the regular generalized eigenproblem Ax = λBx, when λ is a semi-simple and finite eigenvalue, which departs from the classical analysis with the chordal norm [9]. A backward error and a condition number are derived for a choice of flexible

Note on the paper “a general equation in

Note on the paper “a general equation in polycondensation”

✍ C. Cameron 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a