• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 52 matches

• 2016
• 
  Pablo Adasme, Abdel Lisser:
  Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks. J. Sched. 19(3): 349-366 (2016)
• 
  Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
  Throughput maximization for speed scaling with agreeable deadlines. J. Sched. 19(6): 619-625 (2016)
• 
  Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
  A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19(5): 563-582 (2016)
• 
  Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou:
  Measuring the impact of adversarial errors on packet scheduling strategies. J. Sched. 19(2): 135-152 (2016)
• 
  Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan:
  Co-scheduling algorithms for high-throughput workload execution. J. Sched. 19(6): 627-640 (2016)
• 
  Anne Benoit, Mathias Coqblin, Jean-Marc Nicod, Veronika Rehn-Sonigo:
  Optimizing memory allocation for multistage scheduling including setup times. J. Sched. 19(6): 641-658 (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. J. Sched. 19(4): 367-376 (2016)
• 
  Jacek Blazewicz, Nathanael Cheriere, Pierre-François Dutot, Jedrzej Musial, Denis Trystram:
  Novel dual discounting functions for the Internet shopping optimization problem: new algorithms. J. Sched. 19(3): 245-255 (2016)
• 
  Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
  New challenges in scheduling theory. J. Sched. 19(6): 617-618 (2016)
• 
  Stefan Bock:
  Finding optimal tour schedules on transportation paths under extended time window constraints. J. Sched. 19(5): 527-546 (2016)
• 
  Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu:
  Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19(4): 401-408 (2016)
• 
  Peter Brucker, Natalia V. Shakhlevich:
  Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Sched. 19(6): 659-685 (2016)
• 
  Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau:
  Scheduling for electricity cost in a smart grid. J. Sched. 19(6): 687-699 (2016)
• 
  Edmund K. Burke, Michael L. Pinedo:
  Journal of Scheduling (2016). J. Sched. 19(1): 1 (2016)
• 
  Yuri Bykov, Sanja Petrovic:
  A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling. J. Sched. 19(4): 479-492 (2016)
• 
  Sara Ceschia, Andrea Schaerf:
  Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J. Sched. 19(4): 377-389 (2016)
• 
  Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
  Normal-form preemption sequences for an open problem in scheduling theory. J. Sched. 19(6): 701-728 (2016)
• 
  Xin Chen, Malgorzata Sterna, Xin Han, Jacek Blazewicz:
  Scheduling on parallel identical machines with late work criterion: Offline and online cases. J. Sched. 19(6): 729-736 (2016)
• 
  Federico Della Croce:
  MP or not MP: that is the question. J. Sched. 19(1): 33-42 (2016)
• 
  Rodolfo Cuevas, Juan-Carlos Ferrer, Mathias A. Klapp, Juan Carlos Muñoz:
  A mixed integer programming approach to multi-skilled workforce scheduling. J. Sched. 19(1): 91-106 (2016)
• 
  Morteza Davari, Erik Demeulemeester, Roel Leus, Fabrice Talla Nobibon:
  Exact algorithms for single-machine scheduling with time windows and precedence constraints. J. Sched. 19(3): 309-334 (2016)
• 
  Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
  Scheduling evacuation operations. J. Sched. 19(4): 467-478 (2016)
• 
  Maria Dostert, A. Politz, Heinz Schmitz:
  A complexity analysis and an algorithmic approach to student sectioning in existing timetables. J. Sched. 19(3): 285-293 (2016)
• 
  Aldar Dugarzhapov, Alexander V. Kononov:
  A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. J. Sched. 19(1): 61-72 (2016)
• 
  Pedro Fernandes, Carla Sofia Pereira, Armando Barbosa:
  A decision support approach to automatic timetabling in higher education institutions. J. Sched. 19(3): 335-348 (2016)
• 
  George H. G. Fonseca, Haroldo G. Santos, Eduardo G. Carrano:
  Late acceptance hill-climbing for high school timetabling. J. Sched. 19(4): 453-465 (2016)
• 
  Michaël Gabay, Christophe Rapine, Nadia Brauner:
  High-multiplicity scheduling on one machine with forbidden start and completion times. J. Sched. 19(5): 609-616 (2016)
• 
  Marco E. T. Gerards, Johann L. Hurink, Philip K. F. Hölzenspies:
  A survey of offline algorithms for energy minimization under deadline constraints. J. Sched. 19(1): 3-19 (2016)
• 
  Zdenek Hanzálek, Tomás Tunys, Premysl Sucha:
  An analysis of the non-preemptive mixed-criticality match-up scheduling problem. J. Sched. 19(5): 601-607 (2016)
• 
  Florian Jaehn, Helmut A. Sedding:
  Scheduling with time-dependent discrepancy times. J. Sched. 19(6): 737-757 (2016)

skipping 22 more matches