Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Norbert Ascheuer"'
Publikováno v:
2014 16th International Conference on Transparent Optical Networks (ICTON).
The EU research project DISCUS defines a future proof end-to-end network architecture for next-generation communication networks. One central decision is at which and at how many Local Exchange (LE) locations the active equipment has to be placed. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1163871221462d701519dd61d4110d8
https://doi.org/10.1109/icton.2014.6876385
https://doi.org/10.1109/icton.2014.6876385
Publikováno v:
Networks. 36:69-79
The asymmetric travelling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper we present a formulation of the problem involving only 0/1-variables associated with the arcs of the underl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e80c10f7751d399d8b1926405adf5b4
https://doi.org/10.1002/1097-0037(200009)36:2<69::aid-net1>3.0.co
https://doi.org/10.1002/1097-0037(200009)36:2<69::aid-net1>3.0.co
Publikováno v:
Computational Optimization and Applications. 17:61-84
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb33f228641214d92014ae4a53c5168b
https://doi.org/10.1023/a:1008779125567
https://doi.org/10.1023/a:1008779125567
Publikováno v:
Mathematical Methods of Operations Research (ZOR). 49:501-515
We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decision
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9de376bedee986b76b80b3cb9c67951c
https://doi.org/10.1007/s001860050064
https://doi.org/10.1007/s001860050064
Publikováno v:
SIAM Journal on Optimization. 3:25-42
The sequential ordering problem (SOP) finds a minimum cost Hamiltonian path subject to certain precedence constraints. The SOP has a number of practical applications and arises, for instance, in production planning for flexible manufacturing systems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::850c684c692e0dc19ccb6ddac7f6acaf
https://doi.org/10.1137/0803002
https://doi.org/10.1137/0803002
Many optimization problems have several equivalent mathematical models. It is often not apparent which of these models is most suitable for practical computation, in particular, when a certain application with a specific range of instance sizes is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::182d8c0256cb7ba954b6d6439f6ca522
http://hdl.handle.net/11577/3389510
http://hdl.handle.net/11577/3389510
Publikováno v:
STACS 2000 ISBN: 9783540671411
STACS
STACS
We consider the following online dial-a-ride problem (OLDARP): Objects are to be transported between points in a metric space. Transportation requests arrive online, specifying the objects to be transported and the corresponding source and destinatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f77b6644132085274e3f0cdbcac16239
https://doi.org/10.1007/3-540-46541-3_53
https://doi.org/10.1007/3-540-46541-3_53
Publikováno v:
Operations Research Proceedings 1998 ISBN: 9783540653813
In “classical” optimization, all data of a problem instance are considered given. The standard theory and the usual algorithmic techniques apply to such cases only. Online optimization is different. Many decisions have to be made before all data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea5e64e74e8adb75d2fb785e83cbcef4
https://doi.org/10.1007/978-3-642-58409-1_2
https://doi.org/10.1007/978-3-642-58409-1_2
Publikováno v:
Mathematik in der Praxis ISBN: 9783642797644
Die Business Unit PC in Augsburg ist die zentrale Produktionsstatte der Siemens-Nixdorf Informationssysteme (SNI) AG fur Personal Computer sowie fur einige Periphargerate. Das Werk, entworfen nach modernen CIM/CAI-Konzepten (Computer Integrated Manuf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc8e710d4d13b56bfce79b83e12a02b7
https://doi.org/10.1007/978-3-642-79763-7_13
https://doi.org/10.1007/978-3-642-79763-7_13
Autor:
Robert Protzmann, Karl Hübner, Norbert Ascheuer, Uwe Bauknecht, Tobias Enderle, Ulrich Gebhard, Christian Raack, Arthur Witt
Publikováno v:
Arthur Witt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69e2d3fa535e84e902bc54aa1d72f811
https://ieeexplore.ieee.org/document/8727112
https://ieeexplore.ieee.org/document/8727112