𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial-time open-shop problem with an arbitrary number of machines

✍ Scribed by S. V. Sevast'yanov

Publisher
Springer US
Year
1992
Tongue
English
Weight
911 KB
Volume
28
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 πŸ‘ 2 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

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
✍ Philippe Baptiste πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 102 KB πŸ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t

A multiple time step algorithm compatibl
A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations
✍ Vincent KrΓ€utler; Philippe H. HΓΌnenberger πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update