Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Jenny Nossack"'
Publikováno v:
OR Spectrum. 41:179-217
We consider a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications by taking account of machine- and operator-dependent processing times. We analyze two objective fun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e99348573fc719c0a13533abcdd0b195
https://doi.org/10.1007/s00291-018-0537-z
https://doi.org/10.1007/s00291-018-0537-z
Publikováno v:
Transportation Science. 52:1059-1076
In this research, we focus on a container dispatching and conflict-free yard crane routing problem that arises at a storage yard in an automated, maritime container terminal. A storage yard serves as an intermediate buffer for import/export container
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d77eaa3feaf6378b90dc9d24e6c67d4
https://doi.org/10.1287/trsc.2017.0811
https://doi.org/10.1287/trsc.2017.0811
Publikováno v:
European Journal of Operational Research. 258:1131-1142
In this research, we focus on the windy rural postman problem with the additional option to zigzag street segments during certain times of the day. If a street is narrow or traffic is light, it is possible (and often desirable) to service both sides
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61d05db5870638ef42ba988ceb334191
https://doi.org/10.1016/j.ejor.2016.09.010
https://doi.org/10.1016/j.ejor.2016.09.010
Publikováno v:
Procedia Engineering. 182:235-240
The focus of this paper is on the windy rural postman problem with the additional option to zigzag street segments during certain times of the day. If a street is narrow or traffic is light, it is possible (and often desirable) to service both sides
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80cf5a5e33658c6cdfba32c09424ea59
https://doi.org/10.1016/j.proeng.2017.03.174
https://doi.org/10.1016/j.proeng.2017.03.174
Publikováno v:
OR Spectrum. 38:1043-1070
In combinatorial auctions, items are sold simultaneously. A substantial component of an auction mechanism is the pricing scheme. Prices determine the auctioneer's revenue and, ideally, justify the outcome of the auction to the bidders. Each bidder sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbdd061117e2563473f23734e16393ce
https://doi.org/10.1007/s00291-016-0430-6
https://doi.org/10.1007/s00291-016-0430-6
Publikováno v:
Operations Research Proceedings ISBN: 9783030184995
OR
OR
This paper addresses a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications. The objective is to minimize the makespan. We present a mixed-integer program and sketch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eedf66dc79bbad62f2a8531f877957f6
Publikováno v:
European Journal of Operational Research. 242:1008-1016
We address a generalization of the asymmetric Traveling Salesman Problem where routes have to be constructed to satisfy customer requests, which either involve the pickup or delivery of a single commodity. A vehicle is to be routed such that the dema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db8b7db209d1d2f56396af86a158e60e
https://doi.org/10.1016/j.ejor.2014.10.053
https://doi.org/10.1016/j.ejor.2014.10.053
Publikováno v:
European Cities in Dynamic Competition ISBN: 9783662564189
Globalization and digitalization have lead to new challenges and perspectives in intermodal transport logistics of large city sea ports and megahubs. In particular, due to an enormous increase of the container throughput over the last decades and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b21e36e6adf33fa563630bc6648ea4bd
https://doi.org/10.1007/978-3-662-56419-6_11
https://doi.org/10.1007/978-3-662-56419-6_11
Autor:
Jenny Nossack, Erwin Pesch
Publikováno v:
Computers & Operations Research. 41:174-184
We focus on the problem of partitioning the vertex set of a directed, edge- and vertex-weighted graph into clusters, i.e., disjoint subsets. Clusters are to be determined such that the sum of the vertex weights within the clusters satisfies an upper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0332cc474e94836eb8a1bb4bd7b4066c
https://doi.org/10.1016/j.cor.2013.08.013
https://doi.org/10.1016/j.cor.2013.08.013