External Links

    Journal: J. Scheduling

    Volume 22, Issue 6

    607 -- 621Simon Emde, Lukas Polten. Sequencing assembly lines to facilitate synchronized just-in-time part supply
    623 -- 634Péter Györgyi, Tamás Kis. Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
    635 -- 661Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr, Christian Weiß. Shop scheduling problems with pliable jobs
    663 -- 676Danny Hermelin, Dvir Shabtay, Nimrod Talmon. On the parameterized tractability of the just-in-time flow-shop scheduling problem
    677 -- 689Wei Wei. Single machine scheduling with stochastically dependent times
    691 -- 707Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin. Single-machine scheduling with job-dependent machine deterioration
    709 -- 714Tianyu Wang, Odile Bellenguez-Morineau. A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time

    Volume 22, Issue 5

    499 -- 515Bahram Alidaee, Haibo Wang 0001, Bryan Kethley, Frank G. Landram. A unified view of parallel machine scheduling with interdependent processing rates
    517 -- 541Amelie Eilken. A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals
    543 -- 565Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen. Single-machine common due date total earliness/tardiness scheduling with machine unavailability
    567 -- 580Adam Kasperski, Pawel Zielinski 0001. Risk-averse single machine scheduling: complexity and approximation
    581 -- 593Rubing Chen, Jinjiang Yuan, Yuan Gao. The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
    595 -- 601Rubing Chen, Jinjiang Yuan. Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
    603 -- 606Mikhail Y. Kovalyov, Dmitrij Sesok. Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

    Volume 22, Issue 4

    379 -- 391S. S. Panwalkar, Christos Koulamas. The evolution of schematic representations of flow shop scheduling problems
    393 -- 411Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum. Malleable scheduling for flows of jobs and applications to MapReduce
    413 -- 431Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner, Jun-Min Wei. Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
    433 -- 447Yumei Huo. Parallel machine makespan minimization subject to machine availability and total completion time constraints
    449 -- 463Yuan Gao, Jinjiang Yuan, Zhigang Wei. Unbounded parallel-batch scheduling with drop-line tasks
    465 -- 471Rachid Benmansour, Oliver Braun, Saïd Hanafi. The single-processor scheduling problem with time restrictions: complexity and related problems
    473 -- 485György Dósa, Leah Epstein. Quality of strong equilibria for selfish bin packing with uniform cost sharing
    487 -- 497János Balogh, Leah Epstein, Asaf Levin. Lower bounds for online bin covering-type problems

    Volume 22, Issue 3

    263 -- 269Tianyu Wang, Odile Bellenguez-Morineau. The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints
    271 -- 288Thomas Felberbauer, Walter J. Gutjahr, Karl F. Doerner. Stochastic project management: multiple projects with multi-skilled human resources
    289 -- 304Miri Gilenson, Hussein Naseraldin, Liron Yedidsion. An approximation scheme for the bi-scenario sum of completion times trade-off problem
    305 -- 313Stéphane Bessy, Rodolphe Giroudeau. Parameterized complexity of a coupled-task scheduling problem
    315 -- 333Yunqiang Yin, Youhua Chen, Kaida Qin, Dujuan Wang. Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
    335 -- 357Ward Passchyn, Frits C. R. Spieksma. Scheduling parallel batching machines in a sequence
    359 -- 377Arne Herzel, Michael Hopf, Clemens Thielen. Multistage interval scheduling games

    Volume 22, Issue 2

    137 -- 154Petra Vogl, Roland Braune, Karl F. Doerner. Scheduling recurring radiotherapy appointments in an ion beam facility - Considering optional activities and time window constraints
    155 -- 172Niels-Christian F. Bagger, Guy Desaulniers, Jacques Desrosiers. Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
    173 -- 182Alessandro Hill, Eduardo Lalla-Ruiz, Stefan Voß, Marcos Goycoolea. A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem
    183 -- 192Hao-wei Zhang, Jun-wei Xie, Qiyong Hu, Zhaojian Zhang, Binfeng Zong. Online pulse interleaving task scheduling for multifunction radar
    193 -- 0Hao-wei Zhang, Jun-wei Xie, Qiyong Hu, Zhaojian Zhang, Binfeng Zong. Correction to: Online pulse interleaving task scheduling for multifunction radar
    195 -- 209Sanjoy K. Baruah, Vincenzo Bonifaci, Renato Bruni, Alberto Marchetti-Spaccamela. ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
    211 -- 237Morteza Davari, Erik Demeulemeester. The proactive and reactive resource-constrained project scheduling problem
    239 -- 253Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang. Scheduling problems over a network of machines
    255 -- 262Peihai Liu, Chao Wang, Xiwen Lu. A note on minimizing total weighted completion time with an unexpected machine unavailable interval

    Volume 22, Issue 1

    1 -- 2Edmund K. Burke, Michael Pinedo. Journal of scheduling (2019)
    3 -- 20Matthias Bentert, René van Bevern, Rolf Niedermeier. Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review
    21 -- 57Arthur Kramer, Anand Subramanian. A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
    59 -- 68Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'Kindt. No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
    69 -- 83Oyku Ahipasaoglu, Nesim Erkip, Oya Ekin Karasan. The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
    85 -- 105Xiaoming Xu, KePing Li, Lixing Yang, ZiYou Gao. An efficient train scheduling algorithm on a single-track railway system
    107 -- 118Francisco Ballestín, Ángeles Pérez, M. Sacramento Quintanilla. Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
    119 -- 135Iftah Gamzu, Danny Segev. A polynomial-time approximation scheme for the airplane refueling problem
    runs on