𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Framework for the Complexity of High-Multiplicity Scheduling Problems

✍ Scribed by N. Brauner; Y. Crama; A. Grigoriev; J. van de Klundert

Book ID
106406969
Publisher
Springer US
Year
2005
Tongue
English
Weight
171 KB
Volume
9
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The counting complexity of a simple sche
The counting complexity of a simple scheduling problem
✍ Gerardo Berbeglia πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the