default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 22
Volume 22, Number 1, February 2019
- Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2019). 1-2 - Matthias Bentert, René van Bevern
, Rolf Niedermeier:
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. 3-20 - Arthur Kramer, Anand Subramanian:
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. 21-57 - Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. 59-68 - Oyku Ahipasaoglu, Nesim Erkip, Oya Ekin Karasan:
The venue management problem: setting staffing levels, shifts and shift schedules at concession stands. 69-83 - Xiaoming Xu, Keping Li, Lixing Yang, Ziyou Gao:
An efficient train scheduling algorithm on a single-track railway system. 85-105 - Francisco Ballestín, Ángeles Pérez, M. Sacramento Quintanilla:
Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. 107-118 - Iftah Gamzu, Danny Segev:
A polynomial-time approximation scheme for the airplane refueling problem. 119-135
Volume 22, Number 2, April 2019
- Petra Vogl, Roland Braune, Karl F. Doerner:
Scheduling recurring radiotherapy appointments in an ion beam facility - Considering optional activities and time window constraints. 137-154 - Niels-Christian Fink Bagger, Guy Desaulniers, Jacques Desrosiers:
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. 155-172 - Alessandro Hill, Eduardo Lalla-Ruiz, Stefan Voß, Marcos Goycoolea:
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem. 173-182 - Haowei Zhang, Jun-wei Xie, Qiyong Hu, Zhaojian Zhang, Binfeng Zong:
Online pulse interleaving task scheduling for multifunction radar. 183-192 - Haowei Zhang, Jun-wei Xie, Qiyong Hu, Zhaojian Zhang, Binfeng Zong:
Correction to: Online pulse interleaving task scheduling for multifunction radar. 193 - Sanjoy K. Baruah, Vincenzo Bonifaci, Renato Bruni, Alberto Marchetti-Spaccamela:
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors. 195-209 - Morteza Davari, Erik Demeulemeester:
The proactive and reactive resource-constrained project scheduling problem. 211-237 - Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang:
Scheduling problems over a network of machines. 239-253 - Peihai Liu, Chao Wang, Xiwen Lu:
A note on minimizing total weighted completion time with an unexpected machine unavailable interval. 255-262
Volume 22, Number 3, June 2019
- Tianyu Wang, Odile Bellenguez-Morineau:
The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. 263-269 - Thomas Felberbauer, Walter J. Gutjahr, Karl F. Doerner:
Stochastic project management: multiple projects with multi-skilled human resources. 271-288 - Miri Gilenson, Hussein Naseraldin, Liron Yedidsion:
An approximation scheme for the bi-scenario sum of completion times trade-off problem. 289-304 - Stéphane Bessy, Rodolphe Giroudeau:
Parameterized complexity of a coupled-task scheduling problem. 305-313 - Yunqiang 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. 315-333 - Ward Passchyn, Frits C. R. Spieksma:
Scheduling parallel batching machines in a sequence. 335-357 - Arne Herzel, Michael Hopf, Clemens Thielen:
Multistage interval scheduling games. 359-377
Volume 22, Number 4, August 2019
- S. S. Panwalkar, Christos Koulamas:
The evolution of schematic representations of flow shop scheduling problems. 379-391 - Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum:
Malleable scheduling for flows of jobs and applications to MapReduce. 393-411 - Hui-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. 413-431 - Yumei Huo:
Parallel machine makespan minimization subject to machine availability and total completion time constraints. 433-447 - Yuan Gao, Jinjiang Yuan, Zhigang Wei:
Unbounded parallel-batch scheduling with drop-line tasks. 449-463 - Rachid Benmansour, Oliver Braun, Saïd Hanafi:
The single-processor scheduling problem with time restrictions: complexity and related problems. 465-471 - György Dósa, Leah Epstein:
Quality of strong equilibria for selfish bin packing with uniform cost sharing. 473-485 - János Balogh, Leah Epstein, Asaf Levin:
Lower bounds for online bin covering-type problems. 487-497
Volume 22, Number 5, October 2019
- Bahram Alidaee, Haibo Wang, Bryan Kethley, Frank G. Landram:
A unified view of parallel machine scheduling with interdependent processing rates. 499-515 - Amelie Eilken:
A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals. 517-541 - Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen:
Single-machine common due date total earliness/tardiness scheduling with machine unavailability. 543-565 - Adam Kasperski, Pawel Zielinski:
Risk-averse single machine scheduling: complexity and approximation. 567-580 - Rubing Chen, Jinjiang Yuan, Yuan Gao:
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. 581-593 - Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. 595-601 - Mikhail Y. Kovalyov, Dmitrij Sesok:
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity. 603-606
Volume 22, Number 6, December 2019
- Simon Emde, Lukas Polten:
Sequencing assembly lines to facilitate synchronized just-in-time part supply. 607-621 - Péter Györgyi, Tamás Kis:
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. 623-634 - Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr, Christian Weiß:
Shop scheduling problems with pliable jobs. 635-661 - Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of the just-in-time flow-shop scheduling problem. 663-676 - Wei Wei:
Single machine scheduling with stochastically dependent times. 677-689 - Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single-machine scheduling with job-dependent machine deterioration. 691-707 - Tianyu Wang, Odile Bellenguez-Morineau:
A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. 709-714
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 2024-10-31 20:19 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:
