𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of a cyclic scheduling problem with identical machines and precedence constraints

✍ Scribed by A. Munier

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
589 KB
Volume
91
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The -machine flowshop problem with unit-
The -machine flowshop problem with unit-time operations and intree precedence constraints
✍ Igor Averbakh; Oded Berman; Ilya Chernykh πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 163 KB

We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number of machines is fixed. This proves a recently stated conjecture.

Complexity of cyclic scheduling problems
Complexity of cyclic scheduling problems: A state-of-the-art survey
✍ Eugene Levner; Vladimir Kats; David Alcaide LΓ³pez de Pablo; T.C.E. Cheng πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 325 KB

## a b s t r a c t In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-ar