𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some results in chromatic scheduling

✍ Scribed by D. de Werra

Publisher
Springer
Year
1974
Tongue
English
Weight
438 KB
Volume
18
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Preassignment requirements in chromatic
Preassignment requirements in chromatic scheduling
✍ D. de Werra; N.V.R. Mahadev πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 615 KB

In open shop and class-teacher timetabling problems preassignment requirements are often present; they are represented by precolorings in the graphs associated with the models. We consider the problem of extending a precoloring to an edge k-coloring of the whole graph (where k is fixed) and we descr

Single machine scheduling problems with
Single machine scheduling problems with financial resource constraints: Some complexity results and properties
✍ Evgeny R. Gafarov; Alexander A. Lazarev; Frank Werner πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 259 KB

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number o

Some new results on simulated annealing
Some new results on simulated annealing applied to the job shop scheduling problem
✍ M. Kolonko πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 256 KB

We present two results about heuristic solutions to the job shop scheduling problem (JSP). First, we show that the well-known analytical results on convergence of simulated annealing (SA) do not hold in the application to the JSP. We give a simple counterexample where the SA process converges agains