default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 25
Volume 25, Number 1, February 2022
- Edmund K. Burke:
Editorial: Journal of Scheduling (2022). 1 - Lennart Zey
, Dirk Briskorn, Nils Boysen:
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area. 3-34 - Arnaud De Coster, Nysret Musliu, Andrea Schaerf, Johannes Schoisswohl, Kate Smith-Miles:
Algorithm selection and instance space analysis for curriculum-based course timetabling. 35-58 - Elín Björk Böðvarsdóttir, Niels-Christian Fink Bagger, Laura Elise Høffner, Thomas J. R. Stidsen:
A flexible mixed integer programming-based system for real-world nurse rostering. 59-88 - Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier:
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. 89-105 - Guilherme Rito, Hervé Paulino:
Scheduling computations with provably low synchronization overheads. 107-124 - Dirk Briskorn, Konrad Stephan, Nils Boysen:
Minimizing the makespan on a single machine subject to modular setups. 125-137
Volume 25, Number 2, April 2022
- Spyros Angelopoulos:
Further connections between contract-scheduling and ray-searching problems. 139-155 - Niels Lindner, Julian Reisch:
An analysis of the parameterized complexity of periodic timetabling. 157-176 - Claudio Szwarcfiter, Yale T. Herer, Avraham Shtub:
Project scheduling in a lean environment to maximize value and minimize overruns. 177-190 - Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods. 191-202 - Marie-Sklaerder Vié, Nicolas Zufferey, Roel Leus:
Aircraft landing planning under uncertain conditions. 203-228 - Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo:
A general scheme for solving a large set of scheduling problems with rejection in FPT time. 229-255 - Kai-Simon Goetzmann, Tobias Harks, Max Klimm:
Correction to: Broadcasting a file in a communication network. 257
Volume 25, Number 3, June 2022
- Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe:
Advances in the practice and theory of automated timetabling. 259 - David Van Bulck, Dries R. Goossens:
Optimizing rest times and differences in games played: an iterative two-phase approach. 261-271 - George H. G. Fonseca, Túlio A. M. Toffolo:
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem. 273-286 - Martin Mariusz Lester:
Pseudo-Boolean optimisation for RobinX sports timetabling. 287-299 - Roberto Maria Rosati, Matteo Petris, Luca Di Gaspero, Andrea Schaerf:
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021. 301-319 - Hesham K. Alfares:
Plant shutdown maintenance workforce team assignment and job scheduling. 321-338 - Johannes Vass, Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Felix Winter:
Exact and meta-heuristic approaches for the production leveling problem. 339-370
Volume 25, Number 4, August 2022
- Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT. 371-390 - Efstratios Rappos, Eric Thiémard, Stephan Robert, Jean-François Hêche:
A mixed-integer programming approach for solving university course timetabling problems. 391-404 - Dennis S. Holm, Rasmus Ø. Mikkelsen, Matias Sørensen, Thomas J. R. Stidsen:
A graph-based MIP formulation of the International Timetabling Competition 2019. 405-428 - Rasmus Ø. Mikkelsen, Dennis S. Holm:
A parallelized matheuristic for the International Timetabling Competition 2019. 429-452 - Felix Winter, Nysret Musliu:
A large neighborhood search approach for the paint shop scheduling problem. 453-475 - Can Akkan, Ayla Gülcü, Zeki Kus:
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. 477-501
Volume 25, Number 5, October 2022
- Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. 503-505 - Maximilian Moser, Nysret Musliu, Andrea Schaerf, Felix Winter:
Exact and metaheuristic approaches for unrelated parallel machine scheduling. 507-534 - Menachem Poss, Dror Rawitz:
Maximizing barrier coverage lifetime with static sensors. 535-545 - Biji Nair, S. Mary Saira Bhanu:
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes. 547-565 - Mohammad Ali Taghikhani, Behnam Zangeneh:
Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources. 567-576 - Gur Mosheiov, Daniel Oron, Dvir Shabtay:
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. 577-587 - Omid Shahvari, Rasaratnam Logendran, Madjid Tavana:
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems. 589-621
Volume 25, Number 6, December 2022
- Jacek Blazewicz:
In memoriam Moshe Dror. 623 - F. Davarian, Javad Behnamian:
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints. 625-641 - Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. 643-657 - Alan J. Soper, Vitaly A. Strusevich:
Preemptive and non-preemptive scheduling on two unrelated parallel machines. 659-674 - Roland Braune:
Packing-based branch-and-bound for discrete malleable task scheduling. 675-704 - Burak Cavdaroglu, Tankut Atan:
Integrated break and carryover effect minimization. 705-719 - Myungho Lee, Kangbok Lee, Michael L. Pinedo:
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs. 721-740
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-02-21 19:21 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:
