Fixed interval scheduling: Models, applications, computational complexity and algorithms

The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 178; číslo 2; s. 331 - 342
Hlavní autoři:	Kovalyov, Mikhail Y., Ng, C.T., Cheng, T.C. Edwin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.04.2007 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Algorithms Applied sciences Discrete starting times Exact sciences and technology Graph theory Interval graph Interval scheduling k-coloring k-track assignment Maximum weight clique Maximum weight independent set Operational research and scientific management Operational research. Management science Scheduling algorithms Scheduling, sequencing Studies Interval graph Maximum weight independent set Discrete starting times Maximum weight clique Interval scheduling k-track assignment k-coloring Resource allocation Transmission channel Unloading Printed circuit board Scheduling Graph theory Bandwidth allocation Computational complexity Wiring Interconnection Algorithm complexity Discrete time Channel allocation Independent set Planning Work planning
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!