• 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 38 matches

• 2023
• 
  Matan Atsmony, Gur Mosheiov:
  Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. J. Sched. 26(2): 193-207 (2023)
• 
  Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
  A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26(4): 369-382 (2023)
• 
  Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
  Mathematical challenges in scheduling theory. J. Sched. 26(6): 519-521 (2023)
• 
  Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
  How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring. J. Sched. 26(1): 19-41 (2023)
• 
  Edmund K. Burke:
  Editorial: Journal of Scheduling (2023). J. Sched. 26(1): 1-2 (2023)
• 
  Mats Carlsson, Sara Ceschia, Luca Di Gaspero, Rasmus Ø. Mikkelsen, Andrea Schaerf, Thomas Jacob Riis Stidsen:
  Exact and metaheuristic methods for a real-world examination timetabling problem. J. Sched. 26(4): 353-367 (2023)
• 
  Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino:
  A quest for a fair schedule: The International Young Physicists' Tournament. J. Sched. 26(1): 3-18 (2023)
• 
  Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng:
  Approximation algorithms for batch scheduling with processing set restrictions. J. Sched. 26(6): 523-533 (2023)
• 
  Vincent Chau, Shengzhong Feng, Kim Thang Nguyen:
  Competitive algorithms for demand response management in a smart grid. J. Sched. 26(6): 535-542 (2023)
• 
  François Clautiaux, Boris Detienne, Henri Lefebvre:
  A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. J. Sched. 26(2): 169-191 (2023)
• 
  Leah Epstein:
  Parallel solutions for preemptive makespan scheduling on two identical machines. J. Sched. 26(1): 61-76 (2023)
• 
  Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
  Malleable scheduling beyond identical machines. J. Sched. 26(5): 425-442 (2023)
• 
  Enrique Gerstl, Gur Mosheiov:
  A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence. J. Sched. 26(4): 403-409 (2023)
• 
  Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit, Haya Brama:
  Graph representation of the fixed route dial-a-ride problem. J. Sched. 26(5): 479-495 (2023)
• 
  Murat Güngör:
  A note on the shifting bottleneck procedure for job shop scheduling. J. Sched. 26(4): 399-402 (2023)
• 
  Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
  Joint replenishment meets scheduling. J. Sched. 26(1): 77-94 (2023)
• 
  Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
  Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023)
• 
  Samir Khuller:
  Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems. J. Sched. 26(5): 411 (2023)
• 
  Wieslaw Kubiak:
  On the complexity of open shop scheduling with time lags. J. Sched. 26(3): 331-334 (2023)
• 
  Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma:
  The flexibility of home away pattern sets. J. Sched. 26(5): 413-423 (2023)
• 
  Shi-Sheng Li, Ren-Xia Chen:
  Competitive two-agent scheduling with release dates and preemption on a single machine. J. Sched. 26(3): 227-249 (2023)
• 
  Bo Li, Minming Li, Xiaowei Wu:
  Well-behaved online load balancing against strategic jobs. J. Sched. 26(5): 443-455 (2023)
• 
  Florian Mischek, Nysret Musliu, Andrea Schaerf:
  Local search approaches for the test laboratory scheduling problem with variable task grouping. J. Sched. 26(5): 457-477 (2023)
• 
  Eiji Mizutani, Kevin Alexander Sánchez Galeano:
  A note on a single-shift days-off scheduling problem with sequence-dependent labor costs. J. Sched. 26(3): 315-329 (2023)
• 
  Niloy J. Mukherjee, Subhash C. Sarin, Daniel A. Neira:
  Lot streaming for a two-stage assembly system in the presence of handling costs. J. Sched. 26(4): 335-351 (2023)
• 
  Kameng Nip, Zhenbo Wang:
  A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. J. Sched. 26(6): 543-558 (2023)
• 
  Ulrich Pferschy, Julia Resch, Giovanni Righini:
  Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. J. Sched. 26(3): 267-287 (2023)
• 
  Olivier Ploton, Vincent T'kindt:
  Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. J. Sched. 26(2): 137-145 (2023)
• 
  Tommaso Schettini, Federico Malucelli, Helena Ramalhinho:
  Scheduling a pick and place packaging line. J. Sched. 26(2): 113-136 (2023)
• 
  Arne Schulz, Malte Fliedner:
  Minimizing the expected waiting time of emergency jobs. J. Sched. 26(2): 147-167 (2023)

skipping 8 more matches