default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 27
Volume 27, Number 1, February 2024
- Broos Maenhout
, Mario Vanhoucke:
Dynamic personnel rescheduling: insights and recovery strategies. 1-27 - Frederik Ferid Ostermeier, Jochen Deuse:
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing. 29-49 - Jiayin Pan, Cong Chen, Yinfeng Xu:
The price of anarchy for a berth allocation game. 51-60 - Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo:
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. 61-86 - Gabrijela Obradovic, Ann-Brith Strömberg, Kristian Lundberg:
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model. 87-101 - Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. 103-118
Volume 27, Number 2, April 2024
- Claire Hanen, Alix Munier Kordon:
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. 119-133 - Chao Li, Zhi Yang, Fajun Yang, Feng Wang:
A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients. 135-149 - Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with non-renewable resources: minimizing the sum of completion times. 151-164 - Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui:
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. 165-182 - Sonia 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. 183-202 - Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich:
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. 203-224
Volume 27, Number 3, June 2024
- Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Dynamic scheduling problems in theory and practice. 225-226 - Matan Atsmony, Baruch Mor, Gur Mosheiov:
Single machine scheduling with step-learning. 227-237 - Dvir Shabtay, Baruch Mor:
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. 239-256 - Helmut A. Sedding:
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time. 257-275 - Lishi Yu, Zhiyi Tan:
Scheduling with periodic availability constraints to minimize makespan. 277-297 - Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang:
Improving scheduling in multi-AGV systems by task prediction. 299-308 - Qiulan Zhao, Jinjiang Yuan:
Single-machine primary-secondary scheduling with total tardiness being the primary criterion. 309-318
Volume 27, Number 4, August 2024
- Alok Baveja, Xiaoran Qu, Aravind Srinivasan:
Approximating weighted completion time via stronger negative correlation. 319-328 - Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
An exact solution with an improved running time for the routing flow shop problem with two machines. 329-340 - Michael Römer:
Block-based state-expanded network models for multi-activity shift scheduling. 341-361 - Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna:
Sequential solutions in machine scheduling games. 363-373 - Seyma Güven-Koçak, Aliza Heching, Pinar Keskinocak, Alejandro Toriello:
Continuity of care in home health care scheduling: a rolling horizon approach. 375-392 - Michele Barbato, Alberto Ceselli, Giovanni Righini:
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses. 393-407
Volume 27, Number 5, October 2024
- Junying He, Soon-Ik Hong, Seong-Hee Kim:
Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing. 409-422 - Younes Aalian, Michel Gamache, Gilles Pesant:
Short-term underground mine planning with uncertain activity durations using constraint programming. 423-439 - Jianzhong Qiu, Jun Wu, Xi Chen, Bingyan Zhao, Yan Fang:
Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time. 441-459 - Maël Guiraud, Yann Strozecki:
Scheduling periodic messages on a shared link without buffering. 461-484 - Tifenn Rault, Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal:
Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization. 485-505 - Shai Krigman, Tal Grinshpoun, Lihi Dery:
Scheduling of Earth observing satellites using distributed constraint optimization. 507-524
Volume 27, Number 6, December 2024
- Julius Hoffmann, Janis S. Neufeld, Udo Buscher:
Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment. 525-543 - Danny Hermelin, Matthias Mnich, Simon Omlor:
Serial batching to minimize the weighted number of tardy jobs. 545-556 - Vance Faber, Noah Streib:
Network routing on regular digraphs and their line graphs. 557-564 - Raphael Kühn, Christian Weiß, Heiner Ackermann, Sandy Heydrich:
Scheduling a single machine with multiple due dates per job. 565-585 - Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems. 587-606 - Tobias Geibinger, Florian Mischek, Nysret Musliu:
Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling. 607-622
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-02 20:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
