default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 26
Volume 26, Number 1, February 2023
- Edmund K. Burke:
Editorial: Journal of Scheduling (2023). 1-2 - 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. 3-18 - Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring. 19-41 - Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao, Shousong Jin:
Collaborative optimization of workshop layout and scheduling. 43-59 - Leah Epstein:
Parallel solutions for preemptive makespan scheduling on two identical machines. 61-76 - Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. 77-94 - Kai Watermeyer, Jürgen Zimmermann:
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints. 95-111
Volume 26, Number 2, April 2023
- Tommaso Schettini, Federico Malucelli, Helena Ramalhinho:
Scheduling a pick and place packaging line. 113-136 - Olivier Ploton, Vincent T'kindt:
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. 137-145 - Arne Schulz, Malte Fliedner:
Minimizing the expected waiting time of emergency jobs. 147-167 - François Clautiaux, Boris Detienne, Henri Lefebvre:
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. 169-191 - Matan Atsmony, Gur Mosheiov:
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. 193-207 - Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable scheduling on a single machine. 209-225
Volume 26, Number 3, June 2023
- Shi-Sheng Li, Ren-Xia Chen:
Competitive two-agent scheduling with release dates and preemption on a single machine. 227-249 - Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu, Jing-Xiao Xu:
Optimization of scheduling problems with deterioration effects and an optional maintenance activity. 251-266 - Ulrich Pferschy, Julia Resch, Giovanni Righini:
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. 267-287 - Yannik Zeiträg, José Rui Figueira:
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling. 289-314 - Eiji Mizutani, Kevin Alexander Sánchez Galeano:
A note on a single-shift days-off scheduling problem with sequence-dependent labor costs. 315-329 - Wieslaw Kubiak:
On the complexity of open shop scheduling with time lags. 331-334
Volume 26, Number 4, August 2023
- Niloy J. Mukherjee, Subhash C. Sarin, Daniel A. Neira:
Lot streaming for a two-stage assembly system in the presence of handling costs. 335-351 - 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. 353-367 - Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A multivariate complexity analysis of the material consumption scheduling problem. 369-382 - Fangfang Wu, Zhongyi Jiang, Run Zhang, Xiandong Zhang:
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms. 383-398 - Murat Güngör:
A note on the shifting bottleneck procedure for job shop scheduling. 399-402 - Enrique Gerstl, Gur Mosheiov:
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence. 403-409
Volume 26, Number 5, October 2023
- Samir Khuller:
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems. 411 - Roel Lambers, Dries R. Goossens, Frits C. R. Spieksma:
The flexibility of home away pattern sets. 413-423 - Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. 425-442 - Bo Li, Minming Li, Xiaowei Wu:
Well-behaved online load balancing against strategic jobs. 443-455 - Florian Mischek, Nysret Musliu, Andrea Schaerf:
Local search approaches for the test laboratory scheduling problem with variable task grouping. 457-477 - Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit, Haya Brama:
Graph representation of the fixed route dial-a-ride problem. 479-495 - Kadri Sylejmani, Edon Gashi, Adrian Ymeri:
Simulated annealing with penalization for university course timetabling. 497-517
Volume 26, Number 6, December 2023
- Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
Mathematical challenges in scheduling theory. 519-521 - Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng:
Approximation algorithms for batch scheduling with processing set restrictions. 523-533 - Vincent Chau, Shengzhong Feng, Kim Thang Nguyen:
Competitive algorithms for demand response management in a smart grid. 535-542 - Kameng Nip, Zhenbo Wang:
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. 543-558 - Yinling Wang, Xin Han, Yong Zhang, Jacek Blazewicz:
An improved approximation algorithm for a scheduling problem with transporter coordination. 559-570 - Wei Yu, Mordecai J. Golin, Guochuan Zhang:
Scheduling on a graph with release times. 571-580
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-10-29 01:39 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:
