Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/scheduling/scheduling20.bht:"
download as .bib file
@article{DBLP:journals/scheduling/AdamaszekRRS17,
author = {Anna Adamaszek and
Marc P. Renault and
Adi Ros{\'{e}}n and
Rob van Stee},
title = {Reordering buffer management with advice},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {423--442},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0487-8},
doi = {10.1007/S10951-016-0487-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AdamaszekRRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AlbrechtS17,
author = {Wolfgang Albrecht and
Martin Steinr{\"{u}}cke},
title = {Continuous-time production, distribution and financial planning with
periodic liquidity balancing},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {219--237},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0488-7},
doi = {10.1007/S10951-016-0488-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AlbrechtS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AngelopoulosLH17,
author = {Spyros Angelopoulos and
Alejandro L{\'{o}}pez{-}Ortiz and
Ang{\`{e}}le M. Hamel},
title = {Optimal scheduling of contract algorithms with soft deadlines},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {267--277},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0483-z},
doi = {10.1007/S10951-016-0483-Z},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AngelopoulosLH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AyestaJN17,
author = {Urtzi Ayesta and
Peter Jacko and
Vladim{\'{\i}}r Nov{\'{a}}k},
title = {Scheduling of multi-class multi-server queueing systems with abandonments},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {129--145},
year = {2017},
url = {https://doi.org/10.1007/s10951-015-0456-7},
doi = {10.1007/S10951-015-0456-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/AyestaJN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BansalDTV17,
author = {Nikhil Bansal and
Christoph D{\"{u}}rr and
Kim Thang Nguyen and
{\'{O}}scar C. V{\'{a}}squez},
title = {The local-global conjecture for scheduling with non-linear cost},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {239--254},
year = {2017},
url = {https://doi.org/10.1007/s10951-015-0466-5},
doi = {10.1007/S10951-015-0466-5},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BansalDTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BartoliniDI17,
author = {Enrico Bartolini and
Mauro Dell'Amico and
Manuel Iori},
title = {Scheduling cleaning activities on trains by minimizing idle times},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {493--506},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0517-1},
doi = {10.1007/S10951-017-0517-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BartoliniDI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BenderTW17,
author = {Marco Bender and
Clemens Thielen and
Stephan Westphal},
title = {Online interval scheduling with a bounded number of failures},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {443--457},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0506-9},
doi = {10.1007/S10951-016-0506-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BenderTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BevernNS17,
author = {Ren{\'{e}} van Bevern and
Rolf Niedermeier and
Ondrej Such{\'{y}}},
title = {A parameterized complexity view on non-preemptively scheduling interval-constrained
jobs: few machines, small looseness, and small slack},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {255--265},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0478-9},
doi = {10.1007/S10951-016-0478-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BevernNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BohmSSV17,
author = {Martin B{\"{o}}hm and
Jir{\'{\i}} Sgall and
Rob van Stee and
Pavel Vesel{\'{y}}},
title = {Online bin stretching with three bins},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {601--621},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0504-y},
doi = {10.1007/S10951-016-0504-Y},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/BohmSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BriandNS17,
author = {Cyril Briand and
Sandra Ulrich Ngueveu and
Premysl Sucha},
title = {Finding an optimal Nash equilibrium to the multi-agent project scheduling
problem},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {475--491},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0516-2},
doi = {10.1007/S10951-017-0516-2},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BriandNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BriskornEB17,
author = {Dirk Briskorn and
Simon Emde and
Nils Boysen},
title = {Scheduling shipments in closed-loop sortation conveyors},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {25--42},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0498-5},
doi = {10.1007/S10951-016-0498-5},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BriskornEB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BulbulS17,
author = {Kerem B{\"{u}}lb{\"{u}}l and
Halil Sen},
title = {An exact extended formulation for the unrelated parallel machine total
weighted completion time problem},
journal = {J. Sched.},
volume = {20},
number = {4},
pages = {373--389},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0485-x},
doi = {10.1007/S10951-016-0485-X},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BulbulS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Burgy17,
author = {Reinhard B{\"{u}}rgy},
title = {A neighborhood for complex job shop scheduling problems with regular
objectives},
journal = {J. Sched.},
volume = {20},
number = {4},
pages = {391--422},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0532-2},
doi = {10.1007/S10951-017-0532-2},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Burgy17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BurkeP17,
author = {Edmund K. Burke and
Michael L. Pinedo},
title = {Journal of Scheduling {(2017)}},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {1},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0509-1},
doi = {10.1007/S10951-017-0509-1},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/BurkeP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CarlierHK17,
author = {Aur{\'{e}}lien Carlier and
Claire Hanen and
Alix Munier Kordon},
title = {The equivalence of two classical list scheduling algorithms for dependent
typed tasks with release dates, due dates and precedence delays},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {303--311},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0507-8},
doi = {10.1007/S10951-016-0507-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CarlierHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChangKM17,
author = {Jessica Chang and
Samir Khuller and
Koyel Mukherjee},
title = {{LP} rounding and combinatorial algorithms for minimizing active and
busy time},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {657--680},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0531-3},
doi = {10.1007/S10951-017-0531-3},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChangKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CherefAAB17,
author = {Azeddine Cheref and
Alessandro Agnetis and
Christian Artigues and
Jean{-}Charles Billaut},
title = {Complexity results for an integrated single machine scheduling and
outbound delivery problem with fixed sequence},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {681--693},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0540-2},
doi = {10.1007/S10951-017-0540-2},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CherefAAB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakFHKLN17,
author = {Marek Chrobak and
Uriel Feige and
Mohammad Taghi Hajiaghayi and
Sanjeev Khanna and
Fei Li and
Seffi Naor},
title = {A greedy approximation algorithm for minimum-gap scheduling},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {279--292},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0492-y},
doi = {10.1007/S10951-016-0492-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChrobakFHKLN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CichenskiJPPSB17,
author = {Mateusz Cichenski and
Florian Jaehn and
Grzegorz Pawlak and
Erwin Pesch and
Gaurav Singh and
Jacek Blazewicz},
title = {An integrated model for the transshipment yard scheduling problem},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {57--65},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0470-4},
doi = {10.1007/S10951-016-0470-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CichenskiJPPSB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CramaGLSS17,
author = {Yves Crama and
Dries R. Goossens and
Roel Leus and
Micha{\"{e}}l Schyns and
Frits C. R. Spieksma},
title = {Special issue: Twelfth Workshop on Models and Algorithms for Planning
and Scheduling Problems {(MAPSP} 2015)},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {543},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0548-7},
doi = {10.1007/S10951-017-0548-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CramaGLSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Dosa17,
author = {Gy{\"{o}}rgy D{\'{o}}sa},
title = {Batched bin packing revisited},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {199--209},
year = {2017},
url = {https://doi.org/10.1007/s10951-015-0431-3},
doi = {10.1007/S10951-015-0431-3},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Dosa17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/EpsteinY17,
author = {Leah Epstein and
Ido Yatsiv},
title = {Preemptive scheduling on uniformly related machines: minimizing the
sum of the largest pair of job completion times},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {115--127},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0476-y},
doi = {10.1007/S10951-016-0476-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/EpsteinY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ErnstOST17,
author = {Andreas T. Ernst and
Ceyda Oguz and
Gaurav Singh and
Gita Taherkhani},
title = {Mathematical models for the berth allocation problem in dry bulk terminals},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {459--473},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0510-8},
doi = {10.1007/S10951-017-0510-8},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ErnstOST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/FeldmanN17,
author = {Moran Feldman and
Joseph (Seffi) Naor},
title = {Non-preemptive buffer management for latency sensitive packets},
journal = {J. Sched.},
volume = {20},
number = {4},
pages = {337--353},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0474-0},
doi = {10.1007/S10951-016-0474-0},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/FeldmanN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/FeuersteinMSSSS17,
author = {Esteban Feuerstein and
Alberto Marchetti{-}Spaccamela and
Frans Schalekamp and
Ren{\'{e}} Sitters and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
title = {Minimizing worst-case and average-case makespan over scenarios},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {545--555},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0484-y},
doi = {10.1007/S10951-016-0484-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/FeuersteinMSSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GrigoriuB17,
author = {Liliana Grigoriu and
Dirk Briskorn},
title = {Scheduling jobs and maintenance activities subject to job-dependent
machine deteriorations},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {183--197},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0502-0},
doi = {10.1007/S10951-016-0502-0},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GrigoriuB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GrigoriuF17,
author = {Liliana Grigoriu and
Donald K. Friesen},
title = {Approximation for scheduling on uniform nonsimultaneous parallel machines},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {593--600},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0501-1},
doi = {10.1007/S10951-016-0501-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GrigoriuF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JezMP17,
author = {Lukasz Jez and
Yishay Mansour and
Boaz Patt{-}Shamir},
title = {Scheduling multipacket frames with frame deadlines},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {623--634},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0522-4},
doi = {10.1007/S10951-017-0522-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JezMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JutteMT17,
author = {Silke J{\"{u}}tte and
Daniel M{\"{u}}ller and
Ulrich W. Thonemann},
title = {Optimizing railway crew schedules with fairness preferences},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {43--55},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0499-4},
doi = {10.1007/S10951-016-0499-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JutteMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KalinowskiKS17,
author = {Thomas Kalinowski and
Reena Kapoor and
Martin W. P. Savelsbergh},
title = {Scheduling reclaimers serving a stock pad at a coal terminal},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {85--101},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0495-8},
doi = {10.1007/S10951-016-0495-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KalinowskiKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KowalczykL17,
author = {Daniel Kowalczyk and
Roel Leus},
title = {An exact algorithm for parallel machine scheduling with conflicts},
journal = {J. Sched.},
volume = {20},
number = {4},
pages = {355--372},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0482-0},
doi = {10.1007/S10951-016-0482-0},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KowalczykL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KowalskiWZ17,
author = {Dariusz R. Kowalski and
Prudence W. H. Wong and
Elli Zavou},
title = {Fault tolerant scheduling of tasks of two sizes under resource augmentation},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {695--711},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0541-1},
doi = {10.1007/S10951-017-0541-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KowalskiWZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiLY17,
author = {Chunlin Li and
Yunchang Liu and
Xin Yan},
title = {Optimization-based resource allocation for software as a service application
in cloud computing},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {103--113},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0491-z},
doi = {10.1007/S10951-016-0491-Z},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/LiLY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LinHG17,
author = {Bertrand M. T. Lin and
F. J. Hwang and
Jatinder N. D. Gupta},
title = {Two-machine flowshop scheduling with three-operation jobs subject
to a fixed job sequence},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {293--302},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0493-x},
doi = {10.1007/S10951-016-0493-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/LinHG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/PaprockaS17,
author = {Iwona Paprocka and
Bozena Skolud},
title = {A hybrid multi-objective immune algorithm for predictive and reactive
scheduling},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {165--182},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0494-9},
doi = {10.1007/S10951-016-0494-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/PaprockaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/RanjanKS17,
author = {Anshu Ranjan and
Pramod P. Khargonekar and
Sartaj Sahni},
title = {Offline first-fit decreasing height scheduling of power loads},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {527--542},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0528-y},
doi = {10.1007/S10951-017-0528-Y},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/RanjanKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/RustogiS17,
author = {Kabir Rustogi and
Vitaly A. Strusevich},
title = {Single machine scheduling with a generalized job-dependent cumulative
effect},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {583--592},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0497-6},
doi = {10.1007/S10951-016-0497-6},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/RustogiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/SchulzeZ17,
author = {Marco Schulze and
J{\"{u}}rgen Zimmermann},
title = {Staff and machine shift scheduling in a German potash mine},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {635--656},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0527-z},
doi = {10.1007/S10951-017-0527-Z},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/SchulzeZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/StephanB17,
author = {Konrad Stephan and
Nils Boysen},
title = {Crane scheduling in railway yards: an analysis of computational complexity},
journal = {J. Sched.},
volume = {20},
number = {5},
pages = {507--526},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0520-6},
doi = {10.1007/S10951-017-0520-6},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/StephanB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/UmangBE17,
author = {Nitish Umang and
Michel Bierlaire and
Alan L. Erera},
title = {Real-time management of berth allocation with stochastic arrival and
handling times},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {67--83},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0480-2},
doi = {10.1007/S10951-016-0480-2},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/UmangBE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/WalterWL17,
author = {Rico Walter and
Martin Wirth and
Alexander Lawrinenko},
title = {Improved approaches to the exact solution of the machine covering
problem},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {147--164},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0477-x},
doi = {10.1007/S10951-016-0477-X},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/WalterWL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/WeissWKS17,
author = {Christian Wei{\ss} and
Stefan Waldherr and
Sigrid Knust and
Natalia V. Shakhlevich},
title = {Open Shop Scheduling with Synchronization},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {557--581},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0490-0},
doi = {10.1007/S10951-016-0490-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/WeissWKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YinCWW17,
author = {Yunqiang Yin and
T. C. E. Cheng and
Dujuan Wang and
Chin{-}Chia Wu},
title = {Two-agent flowshop scheduling to maximize the weighted number of just-in-time
jobs},
journal = {J. Sched.},
volume = {20},
number = {4},
pages = {313--335},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0511-7},
doi = {10.1007/S10951-017-0511-7},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/YinCWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Yuan17,
author = {Jinjiang Yuan},
title = {Unary NP-hardness of minimizing the number of tardy jobs with deadlines},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {211--218},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0479-8},
doi = {10.1007/S10951-016-0479-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Yuan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ZografosMA17,
author = {Konstantinos G. Zografos and
Michael A. Madas and
Konstantinos N. Androutsopoulos},
title = {Increasing airport capacity utilisation through optimum slot scheduling:
review of current developments and identification of future needs},
journal = {J. Sched.},
volume = {20},
number = {1},
pages = {3--24},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0496-7},
doi = {10.1007/S10951-016-0496-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ZografosMA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-06-04 10:38 CEST from data curated 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:
