Optimal and online preemptive scheduling on uniformly related machines

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scheduling
1. Verfasser: Ebenlendr, Tomáš (VerfasserIn)
Weitere Verfasser: Sgall, Jiří (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2009
Schlagworte:
Scheduling-Verfahren > Durchlaufzeit > Algorithmus > Heuristik > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Journal of scheduling (2019) 2019 Burke, Edmund
A note on minimizing total weighted completion time with an unexpected machine unavailable interval 2019 Liu, Peihai
Stochastic project management : multiple projects with multi-skilled human resources 2019 Felberbauer, Thomas
Risk-averse single machine scheduling : complexity and approximation 2019 Kasperski, Adam
Parallel machine makespan minimization subject to machine availability and total completion time constraints 2019 Huo, Yumei
Shop scheduling problems with pliable jobs 2019 Knust, Sigrid
Single machine scheduling with stochastically dependent times 2019 Wei, Wei
Scheduling problems over a network of machines 2019 Friggstad, Zachary
Online pulse interleaving task scheduling for multifunction radar 2019 Zhang, Haowei
Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria 2019 Yin, Yunqiang
The evolution of schematic representations of flow shop scheduling problems 2019 Panwalkar, S. S.
Multistage interval scheduling games 2019 Herzel, Arne
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem 2019 Bagger, Niels-Christian Fink
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors 2019 Baruah, Sanjoy K.
Unbounded parallel-batch scheduling with drop-line tasks 2019 Gao, Yuan
A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals 2019 Eilken, Amelie
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines 2019 Chen, Rubing
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine : refining computational complexity 2019 Kovalyov, Mikhail Y.
On the parameterized tractability of the just-in-time flow-shop scheduling problem 2019 Hermelin, Danny
Single-machine scheduling with job-dependent machine deterioration 2019 Luo, Wenchang
Alle Artikel auflisten