External Links

    Journal: J. Scheduling

    Volume 26, Issue 6

    519 -- 521Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang. Mathematical challenges in scheduling theory
    523 -- 533Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng. Approximation algorithms for batch scheduling with processing set restrictions
    535 -- 542Vincent Chau, Shengzhong Feng, Kim Thang Nguyen. Competitive algorithms for demand response management in a smart grid
    543 -- 558Kameng Nip, Zhenbo Wang. A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
    559 -- 570Yinling Wang, Xin Han, Yong Zhang 0001, Jacek Blazewicz. An improved approximation algorithm for a scheduling problem with transporter coordination
    571 -- 580Wei Yu 0010, Mordecai J. Golin, Guochuan Zhang. Scheduling on a graph with release times

    Volume 26, Issue 5

    411 -- 0Samir Khuller. Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems
    413 -- 423Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma. The flexibility of home away pattern sets
    425 -- 442Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos. Malleable scheduling beyond identical machines
    443 -- 455Bo Li 0037, Minming Li, Xiaowei Wu 0001. Well-behaved online load balancing against strategic jobs
    457 -- 477Florian Mischek, Nysret Musliu, Andrea Schaerf. Local search approaches for the test laboratory scheduling problem with variable task grouping
    479 -- 495Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit 0001, Haya Brama. Graph representation of the fixed route dial-a-ride problem
    497 -- 517Kadri Sylejmani, Edon Gashi, Adrian Ymeri. Simulated annealing with penalization for university course timetabling

    Volume 26, Issue 4

    335 -- 351Niloy J. Mukherjee, Subhash C. Sarin, Daniel A. Neira. Lot streaming for a two-stage assembly system in the presence of handling costs
    353 -- 367Mats 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
    369 -- 382Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk 0001, Rolf Niedermeier. A multivariate complexity analysis of the material consumption scheduling problem
    383 -- 398Fangfang Wu, Zhongyi Jiang, Run Zhang, Xiandong Zhang. Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
    399 -- 402Murat Güngör. A note on the shifting bottleneck procedure for job shop scheduling
    403 -- 409Enrique Gerstl, Gur Mosheiov. A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence

    Volume 26, Issue 3

    227 -- 249Shi-sheng Li, Ren-Xia Chen. Competitive two-agent scheduling with release dates and preemption on a single machine
    251 -- 266Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu, Jing-Xiao Xu. Optimization of scheduling problems with deterioration effects and an optional maintenance activity
    267 -- 287Ulrich Pferschy, Julia Resch, Giovanni Righini. Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
    289 -- 314Yannik Zeiträg, José Rui Figueira. Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
    315 -- 329Eiji Mizutani, Kevin Alexander Sánchez Galeano. A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
    331 -- 334Wieslaw Kubiak. On the complexity of open shop scheduling with time lags

    Volume 26, Issue 2

    113 -- 136Tommaso Schettini, Federico Malucelli, Helena Ramalhinho. Scheduling a pick and place packaging line
    137 -- 145Olivier Ploton, Vincent T'Kindt. Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion
    147 -- 167Arne Schulz, Malte Fliedner. Minimizing the expected waiting time of emergency jobs
    169 -- 191François Clautiaux, Boris Detienne, Henri Lefebvre. A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
    193 -- 207Matan Atsmony, Gur Mosheiov. Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
    209 -- 225Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay. Equitable scheduling on a single machine

    Volume 26, Issue 1

    1 -- 2Edmund K. Burke. Editorial: Journal of Scheduling (2023)
    3 -- 18Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino. A quest for a fair schedule: The International Young Physicists' Tournament
    19 -- 41Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger. How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring
    43 -- 59Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao, Shou-Song Jin. Collaborative optimization of workshop layout and scheduling
    61 -- 76Leah Epstein. Parallel solutions for preemptive makespan scheduling on two identical machines
    77 -- 94Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési. Joint replenishment meets scheduling
    95 -- 111Kai Watermeyer, Jürgen Zimmermann 0001. A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
    runs on