default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 19
Volume 19, Number 1, February 2016
- Edmund K. Burke
, Michael L. Pinedo:
Journal of Scheduling (2016). 1 - Marco E. T. Gerards, Johann L. Hurink, Philip K. F. Hölzenspies:
A survey of offline algorithms for energy minimization under deadline constraints. 3-19 - Kejun Zhao, Xiwen Lu, Manzhan Gu:
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines. 21-31 - Federico Della Croce:
MP or not MP: that is the question. 33-42 - Hongbo Li, Erik Demeulemeester:
A genetic algorithm for the robust resource leveling problem. 43-60 - Aldar Dugarzhapov, Alexander V. Kononov:
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. 61-72 - Mark Zais, Manuel Laguna:
A graph coloring approach to the deployment scheduling and unit assignment problem. 73-90 - Rodolfo Cuevas, Juan-Carlos Ferrer, Mathias A. Klapp, Juan Carlos Muñoz:
A mixed integer programming approach to multi-skilled workforce scheduling. 91-106
Volume 19, Number 2, April 2016
- Broos Maenhout, Mario Vanhoucke:
An exact algorithm for an integrated project staffing problem with a homogeneous workforce. 107-133 - Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou:
Measuring the impact of adversarial errors on packet scheduling strategies. 135-152 - Bertrand M. T. Lin, F. J. Hwang, Alexander V. Kononov:
Relocation scheduling subject to fixed processing sequences. 153-163 - Xin Li, Richard Y. K. Fung:
Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times. 165-176 - Adam Kasperski, Pawel Zielinski:
Single machine scheduling problems with uncertain parameters and the OWA criterion. 177-190 - Rym M'Hallah, Ali Alhajraf:
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem. 191-205 - Ivar Massabò, Giuseppe Paletta, Alex J. Ruiz-Torres:
A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem. 207-211
Volume 19, Number 3, June 2016
- Graham Kendall, Greet Vanden Berghe, Barry McCollum:
Preface. 213 - Jens Leoff, Heiner Ackermann, Karl-Heinz Küfer:
Time-hierarchical scheduling - A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem. 215-225 - Clément Pira, Christian Artigues:
Line search method for solving a non-preemptive strictly periodic scheduling problem. 227-243 - Jacek Blazewicz, Nathanael Cheriere, Pierre-François Dutot, Jedrzej Musial, Denis Trystram:
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms. 245-255 - Tomás Müller:
Real-life examination timetabling. 257-270 - Tony Wauters, Joris Kinable, Pieter Smet, Wim Vancroonenburg, Greet Vanden Berghe, Jannes Verstichel:
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. 271-283 - Maria Dostert, A. Politz, Heinz Schmitz:
A complexity analysis and an algorithmic approach to student sectioning in existing timetables. 285-293 - Túlio A. M. Toffolo, Haroldo G. Santos, Marco Antonio Moreira de Carvalho, Janniele A. Soares:
An integer programming approach to the multimode resource-constrained multiproject scheduling problem. 295-307 - Morteza Davari, Erik Demeulemeester, Roel Leus, Fabrice Talla Nobibon:
Exact algorithms for single-machine scheduling with time windows and precedence constraints. 309-334 - Pedro Fernandes, Carla Sofia Pereira, Armando Barbosa:
A decision support approach to automatic timetabling in higher education institutions. 335-348 - Pablo Adasme, Abdel Lisser:
Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks. 349-366
Volume 19, Number 4, August 2016
- Abdoul Bitar, Stéphane Dauzère-Pérès, Claude Yugma, Renaud Roussel:
A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. 367-376 - Sara Ceschia, Andrea Schaerf:
Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. 377-389 - Philippe Laborie, Jerome Rogerie:
Temporal linear relaxation in IBM ILOG CP Optimizer. 391-400 - Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu:
Lawler's minmax cost algorithm: optimality conditions and uncertainty. 401-408 - Patricio Lamas, Erik Demeulemeester:
A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations. 409-428 - Yi Tan, Torsten Hildebrandt, Bernd Scholz-Reiter:
Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem. 429-452 - George H. G. Fonseca, Haroldo G. Santos, Eduardo G. Carrano:
Late acceptance hill-climbing for high school timetabling. 453-465 - Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Scheduling evacuation operations. 467-478 - Yuri Bykov, Sanja Petrovic:
A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling. 479-492
Volume 19, Number 5, October 2016
- Michael Samudra, Carla Van Riet, Erik Demeulemeester, Brecht Cardoen, Nancy Vansteenkiste, Frank E. Rademakers:
Scheduling operating rooms: achievements, challenges and pitfalls. 493-525 - Stefan Bock:
Finding optimal tour schedules on transportation paths under extended time window constraints. 527-546 - Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang:
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime. 547-561 - Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
A reclaimer scheduling problem arising in coal stockyard management. 563-582 - Shubin Xu, James C. Bean:
Scheduling parallel-machine batch operations to maximize on-time delivery performance. 583-600 - Zdenek Hanzálek, Tomás Tunys, Premysl Sucha:
An analysis of the non-preemptive mixed-criticality match-up scheduling problem. 601-607 - Michaël Gabay, Christophe Rapine, Nadia Brauner:
High-multiplicity scheduling on one machine with forbidden start and completion times. 609-616
Volume 19, Number 6, December 2016
- Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. 617-618 - Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput maximization for speed scaling with agreeable deadlines. 619-625 - Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan:
Co-scheduling algorithms for high-throughput workload execution. 627-640 - Anne Benoit, Mathias Coqblin, Jean-Marc Nicod, Veronika Rehn-Sonigo:
Optimizing memory allocation for multistage scheduling including setup times. 641-658 - Peter Brucker, Natalia V. Shakhlevich:
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. 659-685 - Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau:
Scheduling for electricity cost in a smart grid. 687-699 - Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Normal-form preemption sequences for an open problem in scheduling theory. 701-728 - Xin Chen, Malgorzata Sterna, Xin Han, Jacek Blazewicz:
Scheduling on parallel identical machines with late work criterion: Offline and online cases. 729-736 - Florian Jaehn, Helmut A. Sedding:
Scheduling with time-dependent discrepancy times. 737-757 - Yingchao Zhao, Xiangtong Qi, Minming Li:
On scheduling with non-increasing time slot cost to minimize total weighted completion time. 759-767
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
