default search action
Journal of Scheduling, Volume 20
Volume 20, Number 1, February 2017
- Edmund K. Burke
, Michael L. Pinedo:
Journal of Scheduling (2017). 1 - Konstantinos G. Zografos, Michael A. Madas
Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs. 3-24 - Dirk Briskorn
Scheduling shipments in closed-loop sortation conveyors. 25-42 - Silke Jütte
Optimizing railway crew schedules with fairness preferences. 43-55 - Mateusz Cichenski, Florian Jaehn, Grzegorz Pawlak
An integrated model for the transshipment yard scheduling problem. 57-65 - Nitish Umang, Michel Bierlaire
Real-time management of berth allocation with stochastic arrival and handling times. 67-83 - Thomas Kalinowski
Scheduling reclaimers serving a stock pad at a coal terminal. 85-101 - Chunlin Li, Yunchang Liu, Xin Yan:
Optimization-based resource allocation for software as a service application in cloud computing. 103-113
Volume 20, Number 2, April 2017
- Leah Epstein, Ido Yatsiv:
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. 115-127 - Urtzi Ayesta, Peter Jacko
Scheduling of multi-class multi-server queueing systems with abandonments. 129-145 - Rico Walter, Martin Wirth, Alexander Lawrinenko:
Improved approaches to the exact solution of the machine covering problem. 147-164 - Iwona Paprocka
A hybrid multi-objective immune algorithm for predictive and reactive scheduling. 165-182 - Liliana Grigoriu, Dirk Briskorn
Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations. 183-197 - György Dósa:
Batched bin packing revisited. 199-209 - Jinjiang Yuan:
Unary NP-hardness of minimizing the number of tardy jobs with deadlines. 211-218
Volume 20, Number 3, June 2017
- Wolfgang Albrecht, Martin Steinrücke
Continuous-time production, distribution and financial planning with periodic liquidity balancing. 219-237 - Nikhil Bansal, Christoph Dürr, Kim Thang Nguyen, Óscar C. Vásquez
The local-global conjecture for scheduling with non-linear cost. 239-254 - René van Bevern, Rolf Niedermeier, Ondrej Suchý
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. 255-265 - Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal scheduling of contract algorithms with soft deadlines. 267-277 - Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. 279-292 - Bertrand M. T. Lin, F. J. Hwang
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. 293-302 - Aurélien Carlier, Claire Hanen
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays. 303-311
Volume 20, Number 4, August 2017
- Yunqiang Yin, T. C. E. Cheng
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. 313-335 - Moran Feldman
Non-preemptive buffer management for latency sensitive packets. 337-353 - Daniel Kowalczyk
An exact algorithm for parallel machine scheduling with conflicts. 355-372 - Kerem Bülbül
An exact extended formulation for the unrelated parallel machine total weighted completion time problem. 373-389 - Reinhard Bürgy
A neighborhood for complex job shop scheduling problems with regular objectives. 391-422
Volume 20, Number 5, October 2017
- Anna Adamaszek
Reordering buffer management with advice. 423-442 - Marco Bender, Clemens Thielen
Online interval scheduling with a bounded number of failures. 443-457 - Andreas T. Ernst
Mathematical models for the berth allocation problem in dry bulk terminals. 459-473 - Cyril Briand, Sandra Ulrich Ngueveu
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem. 475-491 - Enrico Bartolini, Mauro Dell'Amico
Scheduling cleaning activities on trains by minimizing idle times. 493-506 - Konrad Stephan
Crane scheduling in railway yards: an analysis of computational complexity. 507-526 - Anshu Ranjan
Offline first-fit decreasing height scheduling of power loads. 527-542
Volume 20, Number 6, December 2017
- Yves Crama, Dries R. Goossens, Roel Leus
Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015). 543 - Esteban Feuerstein, Alberto Marchetti-Spaccamela
Minimizing worst-case and average-case makespan over scenarios. 545-555 - Christian Weiß
Open Shop Scheduling with Synchronization. 557-581 - Kabir Rustogi, Vitaly A. Strusevich:
Single machine scheduling with a generalized job-dependent cumulative effect. 583-592 - Liliana Grigoriu, Donald K. Friesen:
Approximation for scheduling on uniform nonsimultaneous parallel machines. 593-600 - Martin Böhm
Online bin stretching with three bins. 601-621 - Lukasz Jez, Yishay Mansour, Boaz Patt-Shamir:
Scheduling multipacket frames with frame deadlines. 623-634 - Marco Schulze, Jürgen Zimmermann:
Staff and machine shift scheduling in a German potash mine. 635-656 - Jessica Chang
LP rounding and combinatorial algorithms for minimizing active and busy time. 657-680 - Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut:
Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence. 681-693 - Dariusz R. Kowalski, Prudence W. H. Wong, Elli Zavou:
Fault tolerant scheduling of tasks of two sizes under resource augmentation. 695-711
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-12-15 01:16 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: