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/anor/anor92.bht:"
download as .bib file
@article{DBLP:journals/anor/BaptistePN99,
author = {Philippe Baptiste and
Claude Le Pape and
Wim Nuijten},
title = {Satisfiability tests and time-bound adjustmentsfor cumulative scheduling
problems},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {305--333},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018995000688},
doi = {10.1023/A\%3A1018995000688},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BaptistePN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BraselHTW99,
author = {Heidemarie Br{\"{a}}sel and
Martin Harborth and
Thomas Tautenhahn and
Per Willenius},
title = {On the set of solutions of the open shop problem},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {241--263},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018938915709},
doi = {10.1023/A\%3A1018938915709},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BraselHTW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BraselHTW99a,
author = {Heidemarie Br{\"{a}}sel and
Martin Harborth and
Thomas Tautenhahn and
Per Willenius},
title = {On the hardness of the classical job shop problem},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {265--279},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018990932547},
doi = {10.1023/A\%3A1018990932547},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BraselHTW99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/CroceTA99,
author = {Federico Della Croce and
Roberto Tadei and
P. S. Asioli},
title = {Scheduling a round robin tennis tournamentunder courts and players
availability constraints},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {349--361},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018999101596},
doi = {10.1023/A\%3A1018999101596},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/CroceTA99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DrobouchevitchS99a,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {A polynomial algorithm for the three-machineopen shop with a bottleneck
machine},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {185--210},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018982630730},
doi = {10.1023/A\%3A1018982630730},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/DrobouchevitchS99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FokkertK99,
author = {Jannet I. van Zante{-}de Fokkert and
A. G. de Kok},
title = {The simultaneous determination of the assignment ofitems to resources,
the cycle times, and the reorderintervals in repetitive {PCB} assembly},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {381--401},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018903302505},
doi = {10.1023/A\%3A1018903302505},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/FokkertK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GerodimosGPT99,
author = {Alex E. Gerodimos and
Celia A. Glass and
Chris N. Potts and
Thomas Tautenhahn},
title = {Scheduling multi-operation jobs on a single machine},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {87--105},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018959420252},
doi = {10.1023/A\%3A1018959420252},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GerodimosGPT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GlazebrookG99,
author = {Kevin D. Glazebrook and
Renate Garbe},
title = {Almost optimal policies for stochastic systemswhich almost satisfy
conservation laws},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {19--43},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018934714800},
doi = {10.1023/A\%3A1018934714800},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GlazebrookG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GlazebrookN99,
author = {Kevin D. Glazebrook and
Jos{\'{e}} Ni{\~{n}}o{-}Mora},
title = {A linear programming approach to stability, optimisationand performance
analysis for Markovian multiclassqueueing networks},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {1--18},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018922412074},
doi = {10.1023/A\%3A1018922412074},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GlazebrookN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GueretP99,
author = {Christelle Gu{\'{e}}ret and
Christian Prins},
title = {A new lower bound for the open-shop problem},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {165--183},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018930613891},
doi = {10.1023/A\%3A1018930613891},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GueretP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GuptaHP99,
author = {Jatinder N. D. Gupta and
A. M. A. Hariri and
Chris N. Potts},
title = {Single-machine scheduling to minimize maximumtardiness with minimum
number of tardy jobs},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {107--123},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018974428912},
doi = {10.1023/A\%3A1018974428912},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GuptaHP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/HartRN99,
author = {Emma Hart and
Peter Ross and
Jeremy A. D. Nelson},
title = {Scheduling chicken catching - An investigationinto the success of
a genetic algorithm on areal-world scheduling problem},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {363--380},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018951218434},
doi = {10.1023/A\%3A1018951218434},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/HartRN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KellererP99,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {Cardinality constrained bin-packing problems},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {335--348},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018947117526},
doi = {10.1023/A\%3A1018947117526},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/KellererP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KononovST99,
author = {Alexander V. Kononov and
Sergey V. Sevastianov and
I. D. Tchernykh},
title = {When difference in machine loads leadsto efficient scheduling in open
shops},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {211--239},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018986731638},
doi = {10.1023/A\%3A1018986731638},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/KononovST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/NeumannS99,
author = {Klaus Neumann and
Welf G. Schneider},
title = {Heuristic algorithms for job-shop scheduling problemswith stochastic
precedence constraints},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {45--63},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018955319343},
doi = {10.1023/A\%3A1018955319343},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/NeumannS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/SchraderW99,
author = {Rainer Schrader and
Georg Wambach},
title = {The setup polytope of \emph{N}-sparse posets},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {125--142},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018926512983},
doi = {10.1023/A\%3A1018926512983},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/SchraderW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ShakhlevichSW99,
author = {Natalia V. Shakhlevich and
Yuri N. Sotskov and
Frank Werner},
title = {Shop-scheduling problems with fixed and non-fixedmachine orders of
the jobs},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {281--304},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018943016617},
doi = {10.1023/A\%3A1018943016617},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/ShakhlevichSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Wegner99,
author = {Ricki Wegner},
title = {Recovering cyclic schedules from delay},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {143--164},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018978529821},
doi = {10.1023/A\%3A1018978529821},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Wegner99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Weiss99,
author = {Gideon Weiss},
title = {An algorithm for minimum wait drainingof two-station fluid re-entrant
line},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {65--86},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018907403413},
doi = {10.1023/A\%3A1018907403413},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Weiss99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/X99a,
title = {Preface},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {0},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018911504322},
doi = {10.1023/A\%3A1018911504322},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/X99a.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-05-24 13:09 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:
