Ausgabe 6/2016
New Challenges in Scheduling Theory
Inhalt (10 Artikel)
Editorial
New challenges in scheduling theory
Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang
Throughput maximization for speed scaling with agreeable deadlines
Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios
Co-scheduling algorithms for high-throughput workload execution
Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan
Optimizing memory allocation for multistage scheduling including setup times
Anne Benoit, Mathias Coqblin, Jean-Marc Nicod, Veronika Rehn-Sonigo
Open Access
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
Peter Brucker, Natalia V. Shakhlevich
Scheduling for electricity cost in a smart grid
Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau
Open Access
Normal-form preemption sequences for an open problem in scheduling theory
Bo Chen, Ed Coffman, Dariusz Dereniowski, Wiesław Kubiak
Open Access
Scheduling on parallel identical machines with late work criterion: Offline and online cases
Xin Chen, Malgorzata Sterna, Xin Han, Jacek Blazewicz
On scheduling with non-increasing time slot cost to minimize total weighted completion time
Yingchao Zhao, Xiangtong Qi, Minming Li