External Links

    Journal: J. Scheduling

    Volume 27, Issue 6

    525 -- 543Julius Hoffmann, Janis S. Neufeld, Udo Buscher. Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
    545 -- 556Danny Hermelin, Matthias Mnich, Simon Omlor. Serial batching to minimize the weighted number of tardy jobs
    557 -- 564Vance Faber, Noah Streib. Network routing on regular digraphs and their line graphs
    565 -- 585Raphael Kühn, Christian Weiß, Heiner Ackermann, Sandy Heydrich. Scheduling a single machine with multiple due dates per job
    587 -- 606Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier. Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
    607 -- 622Tobias Geibinger, Florian Mischek, Nysret Musliu. Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling

    Volume 27, Issue 5

    409 -- 422Junying He, Soon-Ik Hong, Seong-Hee Kim. Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing
    423 -- 439Younes Aalian, Michel Gamache, Gilles Pesant. Short-term underground mine planning with uncertain activity durations using constraint programming
    441 -- 459Jianzhong Qiu, Jun Wu, Xi Chen, Bingyan Zhao, Yan Fang. Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time
    461 -- 484Maël Guiraud, Yann Strozecki. Scheduling periodic messages on a shared link without buffering
    485 -- 505Tifenn Rault, Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal. Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
    507 -- 524Shai Krigman, Tal Grinshpoun, Lihi Dery. Scheduling of Earth observing satellites using distributed constraint optimization

    Volume 27, Issue 4

    319 -- 328Alok Baveja, Xiaoran Qu, Aravind Srinivasan. Approximating weighted completion time via stronger negative correlation
    329 -- 340Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov. An exact solution with an improved running time for the routing flow shop problem with two machines
    341 -- 361Michael Römer. Block-based state-expanded network models for multi-activity shift scheduling
    363 -- 373Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna. Sequential solutions in machine scheduling games
    375 -- 392Seyma Güven-Koçak, Aliza Heching, Pinar Keskinocak, Alejandro Toriello. Continuity of care in home health care scheduling: a rolling horizon approach
    393 -- 407Michele Barbato, Alberto Ceselli, Giovanni Righini. A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

    Volume 27, Issue 3

    225 -- 226Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov. Dynamic scheduling problems in theory and practice
    227 -- 237Matan Atsmony, Baruch Mor, Gur Mosheiov. Single machine scheduling with step-learning
    239 -- 256Dvir Shabtay, Baruch Mor. Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
    257 -- 275Helmut A. Sedding. Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
    277 -- 297Lishi Yu, Zhiyi Tan 0001. Scheduling with periodic availability constraints to minimize makespan
    299 -- 308Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan 0002, Yaonan Wang. Improving scheduling in multi-AGV systems by task prediction
    309 -- 318Qiulan Zhao, Jinjiang Yuan. Single-machine primary-secondary scheduling with total tardiness being the primary criterion

    Volume 27, Issue 2

    119 -- 133Claire Hanen, Alix Munier Kordon. Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
    135 -- 149Chao Li, Zhi Yang, FaJun Yang, Feng Wang. A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients
    151 -- 164Kristóf Bérczi, Tamás Király, Simon Omlor. Scheduling with non-renewable resources: minimizing the sum of completion times
    165 -- 182Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui. A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment
    183 -- 202Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière. A scheduling framework for distributed key-value stores and its application to tail latency minimization
    203 -- 224Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich. Preemptive scheduling of parallel jobs of two sizes with controllable processing times

    Volume 27, Issue 1

    1 -- 27Broos Maenhout, Mario Vanhoucke. Dynamic personnel rescheduling: insights and recovery strategies
    29 -- 49Frederik Ferid Ostermeier, Jochen Deuse. A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
    51 -- 60Jiayin Pan, Cong Chen, Yinfeng Xu. The price of anarchy for a berth allocation game
    61 -- 86Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo. Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
    87 -- 101Gabrijela Obradovic, Ann-Brith Strömberg, Kristian Lundberg. Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model
    103 -- 118Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. The preemptive resource allocation problem
    runs on