Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/scheduling/scheduling12.bht:"
@article{DBLP:journals/scheduling/AgnetisDPS09, author = {Alessandro Agnetis and Paolo Detti and Marco Pranzo and Manbir Singh Sodhi}, title = {Sequencing unreliable jobs on parallel machines}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {45--54}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0076-6}, doi = {10.1007/S10951-008-0076-6}, timestamp = {Fri, 11 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/AgnetisDPS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/AgnetisPP09, author = {Alessandro Agnetis and Gianluca de Pascale and Dario Pacciarelli}, title = {A Lagrangian approach to single-machine scheduling problems with two competing agents}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {401--415}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0098-0}, doi = {10.1007/S10951-008-0098-0}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/AgnetisPP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/AngelBPT09, author = {Eric Angel and Evripidis Bampis and Fanny Pascual and Alex{-}Ariel Tchetgnia}, title = {On truthfulness and approximation for scheduling selfish tasks}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {437--445}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0118-8}, doi = {10.1007/S10951-009-0118-8}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/AngelBPT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ArtiguesB09, author = {Christian Artigues and Cyril Briand}, title = {The resource-constrained activity insertion problem with minimum and maximum time lags}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {447--460}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0124-x}, doi = {10.1007/S10951-009-0124-X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/ArtiguesB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/AsgeirssonS09, author = {Eyjolfur Ingi Asgeirsson and Cliff Stein}, title = {Bounded-space online bin cover}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {461--474}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0116-x}, doi = {10.1007/S10951-009-0116-X}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/AsgeirssonS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BaptisteKMS09, author = {Philippe Baptiste and Graham Kendall and Alix Munier and Francis Sourd}, title = {Preface}, journal = {J. Sched.}, volume = {12}, number = {6}, pages = {563--564}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0136-6}, doi = {10.1007/S10951-009-0136-6}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BaptisteKMS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BardN09, author = {Jonathan F. Bard and Narameth Nananukul}, title = {The integrated production-inventory-distribution-routing problem}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {257--280}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0081-9}, doi = {10.1007/S10951-008-0081-9}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BardN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BeddoePL09, author = {Gareth Beddoe and Sanja Petrovic and Jingpeng Li}, title = {A hybrid metaheuristic case-based reasoning system for nurse rostering}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {99--119}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0082-8}, doi = {10.1007/S10951-008-0082-8}, timestamp = {Fri, 04 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/BeddoePL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BelienDC09, author = {Jeroen Beli{\"{e}}n and Erik Demeulemeester and Brecht Cardoen}, title = {A decision support system for cyclic master surgery scheduling with multiple objectives}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {147--161}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0086-4}, doi = {10.1007/S10951-008-0086-4}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BelienDC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BidotVLB09, author = {Julien Bidot and Thierry Vidal and Philippe Laborie and J. Christopher Beck}, title = {A theoretic and practical framework for scheduling in a stochastic environment}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {315--344}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0080-x}, doi = {10.1007/S10951-008-0080-X}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BidotVLB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BierwirthM09, author = {Christian Bierwirth and Frank Meisel}, title = {A fast heuristic for quay crane scheduling with interference constraints}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {345--360}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0105-0}, doi = {10.1007/S10951-009-0105-0}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BierwirthM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BirbasDH09, author = {Theodore Birbas and Sophia Daskalaki and Efthymios Housos}, title = {School timetabling for quality student and teacher schedules}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {177--197}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0088-2}, doi = {10.1007/S10951-008-0088-2}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BirbasDH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BruckerS09, author = {Peter Brucker and Natalia V. Shakhlevich}, title = {Inverse scheduling with maximum lateness objective}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {475--488}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0117-9}, doi = {10.1007/S10951-009-0117-9}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BruckerS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Bunde09, author = {David P. Bunde}, title = {Power-aware scheduling for makespan and flow}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {489--500}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0123-y}, doi = {10.1007/S10951-009-0123-Y}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Bunde09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BurkePV09, author = {Edmund K. Burke and Michael L. Pinedo and Steef L. van de Velde}, title = {Editorial}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {1--2}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0100-x}, doi = {10.1007/S10951-008-0100-X}, timestamp = {Wed, 02 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/BurkePV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/CaiWZ09, author = {Xiaoqiang Cai and Xianyi Wu and Xian Zhou}, title = {Stochastic scheduling on parallel machines to minimize discounted holding costs}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {375--388}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0103-2}, doi = {10.1007/S10951-009-0103-2}, timestamp = {Tue, 08 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/CaiWZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/CheongTV09, author = {Chun Yew Cheong and Kay Chen Tan and Bharadwaj Veeravalli}, title = {A multi-objective evolutionary algorithm for examination timetabling}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {121--146}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0085-5}, doi = {10.1007/S10951-008-0085-5}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/CheongTV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ChrobakHS09, author = {Marek Chrobak and Mathilde Hurand and Jir{\'{\i}} Sgall}, title = {Algorithms for testing fault-tolerance of sequenced jobs}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {501--515}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0126-8}, doi = {10.1007/S10951-009-0126-8}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/ChrobakHS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/EbenlendrS09, author = {Tom{\'{a}}s Ebenlendr and Jir{\'{\i}} Sgall}, title = {Optimal and online preemptive scheduling on uniformly related machines}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {517--527}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0119-7}, doi = {10.1007/S10951-009-0119-7}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/EbenlendrS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ElvikisHK09, author = {Donatas Elvikis and Horst W. Hamacher and Marcel T. Kalsch}, title = {Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {361--374}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0094-4}, doi = {10.1007/S10951-008-0094-4}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/ElvikisHK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/EvenHKR09, author = {Guy Even and Magn{\'{u}}s M. Halld{\'{o}}rsson and Lotem Kaplan and Dana Ron}, title = {Scheduling with conflicts: online and offline algorithms}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {199--224}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0089-1}, doi = {10.1007/S10951-008-0089-1}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/EvenHKR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/FilippiR09, author = {Carlo Filippi and Giorgio Romanin{-}Jacur}, title = {Exact and approximate algorithms for high-multiplicity parallel machine scheduling}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {529--541}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0122-z}, doi = {10.1007/S10951-009-0122-Z}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/FilippiR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/FuTY09, author = {Ruyan Fu and Ji Tian and Jinjiang Yuan}, title = {On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {91--97}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0084-6}, doi = {10.1007/S10951-008-0084-6}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/FuTY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/GarridoAO09, author = {Antonio Garrido and Marlene Arang{\'{u}} and Eva Onaindia}, title = {A constraint programming formulation for planning: from plan scheduling to plan generation}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {227--256}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0083-7}, doi = {10.1007/S10951-008-0083-7}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/GarridoAO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/GawiejnowiczKP09, author = {Stanislaw Gawiejnowicz and Wieslaw Kurc and Lidia Pankowska}, title = {Conjugate problems in time-dependent scheduling}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {543--553}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0121-0}, doi = {10.1007/S10951-009-0121-0}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/GawiejnowiczKP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/HanenZ09, author = {Claire Hanen and Yakov Zinder}, title = {The worst-case analysis of the Garey-Johnson algorithm}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {389--400}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0101-4}, doi = {10.1007/S10951-009-0101-4}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/HanenZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/KaoSJ09, author = {Gio K. Kao and Edward C. Sewell and Sheldon H. Jacobson}, title = {A branch, bound, and remember algorithm for the 1{\(\vert\)} \emph{r} \({}_{\mbox{ \emph{i} }}\){\(\vert\)} Sigma \emph{t} \({}_{\mbox{ \emph{i} }}\) scheduling problem}, journal = {J. Sched.}, volume = {12}, number = {2}, pages = {163--175}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0087-3}, doi = {10.1007/S10951-008-0087-3}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/KaoSJ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Levner09, author = {Eugene Levner}, title = {J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Handbook on scheduling: from theory to applications}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {433--434}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0099-z}, doi = {10.1007/S10951-008-0099-Z}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Levner09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/LiW09, author = {Haitao Li and Keith Womer}, title = {Scheduling projects with multi-skilled personnel by a hybrid {MILP/CP} benders decomposition algorithm}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {281--298}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0079-3}, doi = {10.1007/S10951-008-0079-3}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/LiW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/MeloUR09, author = {Rafael A. Melo and Sebasti{\'{a}}n Urrutia and Celso C. Ribeiro}, title = {The traveling tournament problem with predefined venues}, journal = {J. Sched.}, volume = {12}, number = {6}, pages = {607--622}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0097-1}, doi = {10.1007/S10951-008-0097-1}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/MeloUR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Muller-HannemannS09, author = {Matthias M{\"{u}}ller{-}Hannemann and Alexander Sonnikow}, title = {Non-approximability of just-in-time scheduling}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {555--562}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0120-1}, doi = {10.1007/S10951-009-0120-1}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Muller-HannemannS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/OguzP09, author = {Ceyda Oguz and Kirk Pruhs}, title = {Editorial}, journal = {J. Sched.}, volume = {12}, number = {5}, pages = {435--436}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0102-3}, doi = {10.1007/S10951-009-0102-3}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/OguzP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/OuelhadjP09, author = {Djamila Ouelhadj and Sanja Petrovic}, title = {A survey of dynamic scheduling in manufacturing systems}, journal = {J. Sched.}, volume = {12}, number = {4}, pages = {417--431}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0090-8}, doi = {10.1007/S10951-008-0090-8}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/OuelhadjP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/PepinDHH09, author = {Ann{-}Sophie Pepin and Guy Desaulniers and Alain Hertz and Dennis Huisman}, title = {A comparison of five heuristics for the multiple depot vehicle scheduling problem}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {17--30}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0072-x}, doi = {10.1007/S10951-008-0072-X}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/PepinDHH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/PolicellaCOS09, author = {Nicola Policella and Amedeo Cesta and Angelo Oddi and Stephen F. Smith}, title = {Solve-and-robustify}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {299--314}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0091-7}, doi = {10.1007/S10951-008-0091-7}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/PolicellaCOS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/QuBMML09, author = {Rong Qu and Edmund K. Burke and Barry McCollum and Liam T. G. Merlot and S. Y. Lee}, title = {A survey of search methodologies and automated system development for examination timetabling}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {55--89}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0077-5}, doi = {10.1007/S10951-008-0077-5}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/QuBMML09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/QuFL09, author = {Rong Qu and Maria Fox and Derek Long}, title = {Editorial for {AI} planning and scheduling}, journal = {J. Sched.}, volume = {12}, number = {3}, pages = {225--226}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0095-3}, doi = {10.1007/S10951-008-0095-3}, timestamp = {Tue, 02 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/QuFL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/SteccoCM09, author = {Gabriella Stecco and Jean{-}Fran{\c{c}}ois Cordeau and Elena Moretti}, title = {A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {3--16}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0068-6}, doi = {10.1007/S10951-008-0068-6}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/SteccoCM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/SteinerZ09, author = {George Steiner and Rui Zhang}, title = {Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains}, journal = {J. Sched.}, volume = {12}, number = {6}, pages = {565--574}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0109-9}, doi = {10.1007/S10951-009-0109-9}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/SteinerZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/TanakaFA09, author = {Shunji Tanaka and Shuji Fujikuma and Mituhiko Araki}, title = {An exact algorithm for single-machine scheduling without machine idle time}, journal = {J. Sched.}, volume = {12}, number = {6}, pages = {575--593}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0093-5}, doi = {10.1007/S10951-008-0093-5}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/TanakaFA09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/TrautmannS09, author = {Norbert Trautmann and Christoph Schwindt}, title = {A cyclic approach to large-scale short-term planning in chemical batch production}, journal = {J. Sched.}, volume = {12}, number = {6}, pages = {595--606}, year = {2009}, url = {https://doi.org/10.1007/s10951-009-0107-y}, doi = {10.1007/S10951-009-0107-Y}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/TrautmannS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/WangXC09, author = {Zhenbo Wang and Wenxun Xing and Bo Chen}, title = {On-line service scheduling}, journal = {J. Sched.}, volume = {12}, number = {1}, pages = {31--43}, year = {2009}, url = {https://doi.org/10.1007/s10951-008-0075-7}, doi = {10.1007/S10951-008-0075-7}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/WangXC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.