Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 23
Volume 23, Number 1, February 2020
- Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2020). 1-2 - Stanislaw Gawiejnowicz
:
A review of four decades of time-dependent scheduling: main results, new topics, and open problems. 3-47 - V. Anjana, Rajagopalan Sridharan, P. N. Ram Kumar:
Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times. 49-69 - Henriette Koch, Maximilian Schlögell, Andreas Bortfeldt:
A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls. 71-93 - Laurent Daudet, Frédéric Meunier:
Minimizing the waiting time for a one-way shuttle service. 95-115 - Florian Jaehn, Andreas Wiehl:
Approximation algorithms for the twin robot scheduling problem. 117-133 - Philippe Chrétienne:
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures. 135-143 - S. S. Panwalkar, Christos Koulamas:
Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines. 145-154
Volume 23, Number 2, April 2020
- Islam Akaria, Leah Epstein:
An optimal online algorithm for scheduling with general machine cost functions. 155-162 - Federico Della Croce, Rosario Scatamacchia:
The Longest Processing Time rule for identical parallel machines revisited. 163-176 - Ferdinand Kiermaier, Markus Frey, Jonathan F. Bard:
The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers. 177-209 - Kai-Simon Goetzmann, Tobias Harks, Max Klimm:
Broadcasting a file in a communication network. 211-232 - Alexander Tesch:
A polyhedral study of event-based models for the resource-constrained project scheduling problem. 233-251 - Komarudin, Tim De Feyter, Marie-Anne Guerry, Greet Vanden Berghe:
The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period. 253-264 - Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout:
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. 265-288
Volume 23, Number 3, June 2020
- Enrique Gerstl, Gur Mosheiov:
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. 289-299 - Rob Van Eynde, Mario Vanhoucke:
Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling. 301-325 - Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park:
Two-machine flow shops with an optimal permutation schedule under a storage constraint. 327-336 - Renata Mansini, Roberto Zanotti:
Optimizing the physician scheduling problem in a large hospital ward. 337-361 - Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde:
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. 363-377 - Alex Krumer, Reut Megidish, Aner Sela:
The optimal design of round-robin tournaments with three players. 379-396 - Zachariah Stevenson, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant. 397-410
Volume 23, Number 4, August 2020
- Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa:
On the exact solution of a large class of parallel machine scheduling problems. 411-429 - Sascha Van Cauwelaert, Cyrille Dejemeppe, Pierre Schaus:
An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities. 431-449 - Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible algorithms for multiproblem solving. 451-464 - Dirk Briskorn, Lennart Zey:
Interference aware scheduling of triple-crossover-cranes. 465-485 - Junqiang Wang, Guo-qiang Fan, Zhixin Liu:
Mixed batch scheduling on identical machines. 487-496 - Shi-Sheng Li, Jinjiang Yuan:
Single-machine scheduling with multi-agents to minimize total weighted late work. 497-512 - Tolga Bektas, Alper Hamzadayi, Rubén Ruiz:
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem. 513-523
Volume 23, Number 5, October 2020
- Jinwen Ou:
Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection. 525-538 - Tristan Becker:
A decomposition heuristic for rotational workforce scheduling. 539-554 - Bruno Gaujal, Alain Girault, Stéphan Plassart:
Dynamic speed scaling minimizing expected energy consumption for real-time tasks. 555-574 - Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. 575-593 - Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin:
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. 595-608 - Cheng He, Chunqi Xu, Hao Lin:
Serial-batching scheduling with two agents to minimize makespan and maximum cost. 609-617 - Byung-Cheon Choi, Myoung-Ju Park:
Scheduling two projects with controllable processing times in a single-machine environment. 619-628
Volume 23, Number 6, December 2020
- Alessandro Agnetis, Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Editorial: Dynamic Scheduling Problems. 629-630 - Baruch Mor, Gur Mosheiov, Dana Shapira:
Flowshop scheduling with learning effect and job rejection. 631-641 - Nir Halman:
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. 643-648 - Shaojun Lu, Jun Pei, Xinbao Liu, Xiaofei Qian, Nenad Mladenovic, Panos M. Pardalos:
Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing. 649-664 - Alan J. Soper, Vitaly A. Strusevich:
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. 665-680 - Joanna Berlinska:
Scheduling in data gathering networks with background communications. 681-691 - Alexander V. Kononov, Yulia V. Kovalenko:
Approximation algorithms for energy-efficient scheduling of parallel jobs. 693-709 - Farzaneh Karami, Wim Vancroonenburg, Greet Vanden Berghe:
A periodic optimization approach to dynamic pickup and delivery problems with time windows. 711-731 - Stanislaw Gawiejnowicz, Wieslaw Kurc:
New results for an open time-dependent scheduling problem. 733-744 - Yakov M. Shafransky, Viktor Shinkarevich:
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty. 745-749 - Helmut A. Sedding:
Scheduling jobs with a V-shaped time-dependent processing time. 751-768
a service of 
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-05-22 21:34 CEST 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:
