---
_id: '65495'
abstract:
- lang: eng
text: "This paper presents a holistic framework for the transition from diesel to
electric bus networks,\r\ncrucial for meeting EU regulations targeting 100% zero-emission
urban buses by\r\n2035. We employ a two-phase solution framework: in phase 1,
we solve the Charging Location\r\nand Electric Vehicle Scheduling Problem to generate
vehicle schedules that are feasible\r\nfor electric operation; in phase 2, these
schedules serve as input to a multi-period transition\r\nplanning model that minimizes
the total cost of ownership while determining fleet\r\nreplacement and charging
infrastructure deployment. Our experiments show that schedules\r\nobtained from
solving the integrated charging location and vehicle scheduling problem\r\nsignificantly
outperform traditional methods, resulting in lower total cost of ownership. Additionally,\r\ntransition
plans reduce local emissions by up to 85% compared to a diesel-only\r\nscenario.
We find that vehicle rotations with long distances and sufficient idle time are\r\nprioritized
for electrification, enabling earlier emission reductions and cost savings. This\r\nhighlights
the importance of adopting vehicle scheduling tailored for electric buses, rather\r\nthan
relying on legacy diesel schedules."
article_type: original
author:
- first_name: Miriam
full_name: Stumpe, Miriam
id: '64135'
last_name: Stumpe
- first_name: David
full_name: Rößler-von Saß, David
last_name: Rößler-von Saß
- first_name: Kliewer
full_name: Natalia, Kliewer
last_name: Natalia
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: Stumpe M, Rößler-von Saß D, Natalia K, Schryen G. Impact of Vehicle Scheduling
and Strategic Transition Planning on Zero-Emission Bus Systems. Transportation
Research Interdisciplinary Perspectives.
apa: Stumpe, M., Rößler-von Saß, D., Natalia, K., & Schryen, G. (n.d.). Impact
of Vehicle Scheduling and Strategic Transition Planning on Zero-Emission Bus Systems.
Transportation Research Interdisciplinary Perspectives.
bibtex: '@article{Stumpe_Rößler-von Saß_Natalia_Schryen, title={Impact of Vehicle
Scheduling and Strategic Transition Planning on Zero-Emission Bus Systems}, journal={Transportation
Research Interdisciplinary Perspectives}, author={Stumpe, Miriam and Rößler-von
Saß, David and Natalia, Kliewer and Schryen, Guido} }'
chicago: Stumpe, Miriam, David Rößler-von Saß, Kliewer Natalia, and Guido Schryen.
“Impact of Vehicle Scheduling and Strategic Transition Planning on Zero-Emission
Bus Systems.” Transportation Research Interdisciplinary Perspectives, n.d.
ieee: M. Stumpe, D. Rößler-von Saß, K. Natalia, and G. Schryen, “Impact of Vehicle
Scheduling and Strategic Transition Planning on Zero-Emission Bus Systems,” Transportation
Research Interdisciplinary Perspectives.
mla: Stumpe, Miriam, et al. “Impact of Vehicle Scheduling and Strategic Transition
Planning on Zero-Emission Bus Systems.” Transportation Research Interdisciplinary
Perspectives.
short: M. Stumpe, D. Rößler-von Saß, K. Natalia, G. Schryen, Transportation Research
Interdisciplinary Perspectives (n.d.).
date_created: 2026-04-24T09:13:39Z
date_updated: 2026-04-27T09:31:42Z
keyword:
- electric bus
- multi-period planning
- electric vehicle scheduling
- charging infrastructure
- fleet replacement
language:
- iso: eng
publication: Transportation Research Interdisciplinary Perspectives
publication_status: accepted
quality_controlled: '1'
status: public
title: Impact of Vehicle Scheduling and Strategic Transition Planning on Zero-Emission
Bus Systems
type: journal_article
user_id: '40298'
year: '2026'
...
---
_id: '65857'
abstract:
- lang: eng
text: 'This paper presents a holistic framework for the transition from diesel to
electric bus networks, crucial for meeting EU regulations targeting 100% zero-emission
urban buses by 2035. We employ a two-phase solution framework: in phase 1, we
solve the Charging Location and Electric Vehicle Scheduling Problem to generate
vehicle schedules that are feasible for electric operation; in phase 2, these
schedules serve as input to a multi-period transition planning model that minimizes
the total cost of ownership while determining fleet replacement and charging infrastructure
deployment. Our experiments show that schedules obtained from solving the integrated
charging location and vehicle scheduling problem significantly outperform traditional
methods, resulting in lower total cost of ownership. Additionally, transition
plans reduce local emissions by up to 85% compared to a diesel-only scenario.
We find that vehicle rotations with long distances and sufficient idle time are
prioritized for electrification, enabling earlier emission reductions and cost
savings. This highlights the importance of adopting vehicle scheduling tailored
for electric buses, rather than relying on legacy diesel schedules.'
article_number: '102008'
article_type: original
author:
- first_name: Miriam
full_name: Stumpe, Miriam
id: '64135'
last_name: Stumpe
- first_name: David
full_name: Rößler-von Saß, David
last_name: Rößler-von Saß
- first_name: Natalia
full_name: Kliewer, Natalia
last_name: Kliewer
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: Stumpe M, Rößler-von Saß D, Kliewer N, Schryen G. Impact of vehicle scheduling
and strategic transition planning on zero-emission bus systems. Transportation
Research Interdisciplinary Perspectives. 2026;38. doi:10.1016/j.trip.2026.102008
apa: Stumpe, M., Rößler-von Saß, D., Kliewer, N., & Schryen, G. (2026). Impact
of vehicle scheduling and strategic transition planning on zero-emission bus systems.
Transportation Research Interdisciplinary Perspectives, 38, Article
102008. https://doi.org/10.1016/j.trip.2026.102008
bibtex: '@article{Stumpe_Rößler-von Saß_Kliewer_Schryen_2026, title={Impact of vehicle
scheduling and strategic transition planning on zero-emission bus systems}, volume={38},
DOI={10.1016/j.trip.2026.102008},
number={102008}, journal={Transportation Research Interdisciplinary Perspectives},
publisher={Elsevier BV}, author={Stumpe, Miriam and Rößler-von Saß, David and
Kliewer, Natalia and Schryen, Guido}, year={2026} }'
chicago: Stumpe, Miriam, David Rößler-von Saß, Natalia Kliewer, and Guido Schryen.
“Impact of Vehicle Scheduling and Strategic Transition Planning on Zero-Emission
Bus Systems.” Transportation Research Interdisciplinary Perspectives 38
(2026). https://doi.org/10.1016/j.trip.2026.102008.
ieee: 'M. Stumpe, D. Rößler-von Saß, N. Kliewer, and G. Schryen, “Impact of vehicle
scheduling and strategic transition planning on zero-emission bus systems,” Transportation
Research Interdisciplinary Perspectives, vol. 38, Art. no. 102008, 2026, doi:
10.1016/j.trip.2026.102008.'
mla: Stumpe, Miriam, et al. “Impact of Vehicle Scheduling and Strategic Transition
Planning on Zero-Emission Bus Systems.” Transportation Research Interdisciplinary
Perspectives, vol. 38, 102008, Elsevier BV, 2026, doi:10.1016/j.trip.2026.102008.
short: M. Stumpe, D. Rößler-von Saß, N. Kliewer, G. Schryen, Transportation Research
Interdisciplinary Perspectives 38 (2026).
date_created: 2026-06-13T06:38:22Z
date_updated: 2026-06-13T06:46:16Z
ddc:
- '000'
department:
- _id: '277'
doi: 10.1016/j.trip.2026.102008
file:
- access_level: closed
content_type: application/pdf
creator: schryen
date_created: 2026-06-13T06:45:51Z
date_updated: 2026-06-13T06:45:51Z
file_id: '65858'
file_name: ELSEVIER ARTICLE.pdf
file_size: 1379145
relation: main_file
success: 1
file_date_updated: 2026-06-13T06:45:51Z
has_accepted_license: '1'
intvolume: ' 38'
keyword:
- Electric bus
- Multi-period planning
- Electric vehicle scheduling
- Charging infrastructure
- Fleet replacement
language:
- iso: eng
publication: Transportation Research Interdisciplinary Perspectives
publication_identifier:
issn:
- 2590-1982
publication_status: published
publisher: Elsevier BV
status: public
title: Impact of vehicle scheduling and strategic transition planning on zero-emission
bus systems
type: journal_article
user_id: '72850'
volume: 38
year: '2026'
...
---
_id: '20125'
abstract:
- lang: eng
text: Datacenter applications have different resource requirements from network
and developing flow scheduling heuristics for every workload is practically infeasible.
In this paper, we show that deep reinforcement learning (RL) can be used to efficiently
learn flow scheduling policies for different workloads without manual feature
engineering. Specifically, we present LFS, which learns to optimize a high-level
performance objective, e.g., maximize the number of flow admissions while meeting
the deadlines. The LFS scheduler is trained through deep RL to learn a scheduling
policy on continuous online flow arrivals. The evaluation results show that the
trained LFS scheduler admits 1.05x more flows than the greedy flow scheduling
heuristics under varying network load.
author:
- first_name: Asif
full_name: Hasnain, Asif
id: '63288'
last_name: Hasnain
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Hasnain A, Karl H. Learning Flow Scheduling. In: 2021 IEEE 18th Annual
Consumer Communications & Networking Conference (CCNC). IEEE Computer
Society. doi:https://doi.org/10.1109/CCNC49032.2021.9369514'
apa: 'Hasnain, A., & Karl, H. (n.d.). Learning Flow Scheduling. In 2021 IEEE
18th Annual Consumer Communications & Networking Conference (CCNC). Las
Vegas, USA: IEEE Computer Society. https://doi.org/10.1109/CCNC49032.2021.9369514'
bibtex: '@inproceedings{Hasnain_Karl, title={Learning Flow Scheduling}, DOI={https://doi.org/10.1109/CCNC49032.2021.9369514},
booktitle={2021 IEEE 18th Annual Consumer Communications & Networking Conference
(CCNC)}, publisher={IEEE Computer Society}, author={Hasnain, Asif and Karl, Holger}
}'
chicago: Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” In 2021
IEEE 18th Annual Consumer Communications & Networking Conference (CCNC).
IEEE Computer Society, n.d. https://doi.org/10.1109/CCNC49032.2021.9369514.
ieee: A. Hasnain and H. Karl, “Learning Flow Scheduling,” in 2021 IEEE 18th Annual
Consumer Communications & Networking Conference (CCNC), Las Vegas, USA.
mla: Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” 2021 IEEE 18th
Annual Consumer Communications & Networking Conference (CCNC), IEEE Computer
Society, doi:https://doi.org/10.1109/CCNC49032.2021.9369514.
short: 'A. Hasnain, H. Karl, in: 2021 IEEE 18th Annual Consumer Communications &
Networking Conference (CCNC), IEEE Computer Society, n.d.'
conference:
end_date: 2021-01-12
location: Las Vegas, USA
name: 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)
start_date: 2021-01-09
date_created: 2020-10-19T14:27:17Z
date_updated: 2022-01-06T06:54:20Z
ddc:
- '000'
department:
- _id: '75'
doi: https://doi.org/10.1109/CCNC49032.2021.9369514
keyword:
- Flow scheduling
- Deadlines
- Reinforcement learning
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9369514
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
publication: 2021 IEEE 18th Annual Consumer Communications & Networking Conference
(CCNC)
publication_status: accepted
publisher: IEEE Computer Society
status: public
title: Learning Flow Scheduling
type: conference
user_id: '63288'
year: '2021'
...
---
_id: '21005'
abstract:
- lang: eng
text: Data-parallel applications are developed using different data programming
models, e.g., MapReduce, partition/aggregate. These models represent diverse resource
requirements of application in a datacenter network, which can be represented
by the coflow abstraction. The conventional method of creating hand-crafted coflow
heuristics for admission or scheduling for different workloads is practically
infeasible. In this paper, we propose a deep reinforcement learning (DRL)-based
coflow admission scheme -- LCS -- that can learn an admission policy for a higher-level
performance objective, i.e., maximize successful coflow admissions, without manual
feature engineering. LCS is trained on a production trace, which has online coflow
arrivals. The evaluation results show that LCS is able to learn a reasonable admission
policy that admits more coflows than state-of-the-art Varys heuristic while meeting
their deadlines.
author:
- first_name: Asif
full_name: Hasnain, Asif
id: '63288'
last_name: Hasnain
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Hasnain A, Karl H. Learning Coflow Admissions. In: IEEE INFOCOM 2021 -
IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE
Communications Society. doi:10.1109/INFOCOMWKSHPS51825.2021.9484599'
apa: 'Hasnain, A., & Karl, H. (n.d.). Learning Coflow Admissions. In IEEE
INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).
Vancouver BC Canada: IEEE Communications Society. https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599'
bibtex: '@inproceedings{Hasnain_Karl, title={Learning Coflow Admissions}, DOI={10.1109/INFOCOMWKSHPS51825.2021.9484599},
booktitle={IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops
(INFOCOM WKSHPS)}, publisher={IEEE Communications Society}, author={Hasnain, Asif
and Karl, Holger} }'
chicago: Hasnain, Asif, and Holger Karl. “Learning Coflow Admissions.” In IEEE
INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).
IEEE Communications Society, n.d. https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484599.
ieee: A. Hasnain and H. Karl, “Learning Coflow Admissions,” in IEEE INFOCOM 2021
- IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Vancouver
BC Canada.
mla: Hasnain, Asif, and Holger Karl. “Learning Coflow Admissions.” IEEE INFOCOM
2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS),
IEEE Communications Society, doi:10.1109/INFOCOMWKSHPS51825.2021.9484599.
short: 'A. Hasnain, H. Karl, in: IEEE INFOCOM 2021 - IEEE Conference on Computer
Communications Workshops (INFOCOM WKSHPS), IEEE Communications Society, n.d.'
conference:
end_date: 2021-05-13
location: Vancouver BC Canada
name: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
start_date: 2021-05-10
date_created: 2021-01-16T18:24:19Z
date_updated: 2022-01-06T06:54:42Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/INFOCOMWKSHPS51825.2021.9484599
keyword:
- Coflow scheduling
- Reinforcement learning
- Deadlines
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9484599
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops
(INFOCOM WKSHPS)
publication_status: accepted
publisher: IEEE Communications Society
related_material:
link:
- relation: confirmation
url: https://ieeexplore.ieee.org/document/9484599
status: public
title: Learning Coflow Admissions
type: conference
user_id: '63288'
year: '2021'
...
---
_id: '17082'
abstract:
- lang: eng
text: Data-parallel applications run on cluster of servers in a datacenter and their
communication triggers correlated resource demand on multiple links that can be
abstracted as coflow. They often desire predictable network performance, which
can be passed to network via coflow abstraction for application-aware network
scheduling. In this paper, we propose a heuristic and an optimization algorithm
for predictable network performance such that they guarantee coflows completion
within their deadlines. The algorithms also ensure high network utilization, i.e.,
it's work-conserving, and avoids starvation of coflows. We evaluate both algorithms
via trace-driven simulation and show that they admit 1.1x more coflows than the
Varys scheme while meeting their deadlines.
author:
- first_name: Asif
full_name: Hasnain, Asif
id: '63288'
last_name: Hasnain
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Hasnain A, Karl H. Coflow Scheduling with Performance Guarantees for Data
Center Applications. In: 2020 20th IEEE/ACM International Symposium on Cluster,
Cloud and Internet Computing (CCGRID). IEEE Computer Society; 2020. doi:https://doi.org/10.1109/CCGrid49817.2020.00010'
apa: 'Hasnain, A., & Karl, H. (2020). Coflow Scheduling with Performance Guarantees
for Data Center Applications. In 2020 20th IEEE/ACM International Symposium
on Cluster, Cloud and Internet Computing (CCGRID). Melbourne, Australia: IEEE
Computer Society. https://doi.org/10.1109/CCGrid49817.2020.00010'
bibtex: '@inproceedings{Hasnain_Karl_2020, title={Coflow Scheduling with Performance
Guarantees for Data Center Applications}, DOI={https://doi.org/10.1109/CCGrid49817.2020.00010},
booktitle={2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
Computing (CCGRID)}, publisher={IEEE Computer Society}, author={Hasnain, Asif
and Karl, Holger}, year={2020} }'
chicago: Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees
for Data Center Applications.” In 2020 20th IEEE/ACM International Symposium
on Cluster, Cloud and Internet Computing (CCGRID). IEEE Computer Society,
2020. https://doi.org/10.1109/CCGrid49817.2020.00010.
ieee: A. Hasnain and H. Karl, “Coflow Scheduling with Performance Guarantees for
Data Center Applications,” in 2020 20th IEEE/ACM International Symposium on
Cluster, Cloud and Internet Computing (CCGRID), Melbourne, Australia, 2020.
mla: Hasnain, Asif, and Holger Karl. “Coflow Scheduling with Performance Guarantees
for Data Center Applications.” 2020 20th IEEE/ACM International Symposium on
Cluster, Cloud and Internet Computing (CCGRID), IEEE Computer Society, 2020,
doi:https://doi.org/10.1109/CCGrid49817.2020.00010.
short: 'A. Hasnain, H. Karl, in: 2020 20th IEEE/ACM International Symposium on Cluster,
Cloud and Internet Computing (CCGRID), IEEE Computer Society, 2020.'
conference:
location: Melbourne, Australia
name: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
Computing (CCGRID)
date_created: 2020-06-06T07:40:45Z
date_updated: 2022-01-06T06:53:04Z
ddc:
- '000'
department:
- _id: '75'
doi: https://doi.org/10.1109/CCGrid49817.2020.00010
keyword:
- Coflow
- Scheduling
- Deadlines
- Data centers
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/9139642
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
publication: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet
Computing (CCGRID)
publication_status: published
publisher: IEEE Computer Society
status: public
title: Coflow Scheduling with Performance Guarantees for Data Center Applications
type: conference
user_id: '63288'
year: '2020'
...
---
_id: '5674'
abstract:
- lang: eng
text: In disaster operations management, a challenging task for rescue organizations
occurs when they have to assign and schedule their rescue units to emerging incidents
under time pressure in order to reduce the overall resulting harm. Of particular
importance in practical scenarios is the need to consider collaboration of rescue
units. This task has hardly been addressed in the literature. We contribute to
both modeling and solving this problem by (1) conceptualizing the situation as
a type of scheduling problem, (2) modeling it as a binary linear minimization
problem, (3) suggesting a branch-and-price algorithm, which can serve as both
an exact and heuristic solution procedure, and (4) conducting computational experiments
- including a sensitivity analysis of the effects of exogenous model parameters
on execution times and objective value improvements over a heuristic suggested
in the literature - for different practical disaster scenarios. The results of
our computational experiments show that most problem instances of practically
feasible size can be solved to optimality within ten minutes. Furthermore, even
when our algorithm is terminated once the first feasible solution has been found,
this solution is in almost all cases competitive to the optimal solution and substantially
better than the solution obtained by the best known algorithm from the literature.
This performance of our branch-and-price algorithm enables rescue organizations
to apply our procedure in practice, even when the time for decision making is
limited to a few minutes. By addressing a very general type of scheduling problem,
our approach applies to various scheduling situations.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: Rauchecker G, Schryen G. An Exact Branch-and-Price Algorithm for Scheduling
Rescue Units during Disaster Response. European Journal of Operational Research.
2019;272(1):352-363.
apa: Rauchecker, G., & Schryen, G. (2019). An Exact Branch-and-Price Algorithm
for Scheduling Rescue Units during Disaster Response. European Journal of Operational
Research, 272(1), 352–363.
bibtex: '@article{Rauchecker_Schryen_2019, title={An Exact Branch-and-Price Algorithm
for Scheduling Rescue Units during Disaster Response}, volume={272}, number={1},
journal={European Journal of Operational Research}, publisher={Elsevier}, author={Rauchecker,
Gerhard and Schryen, Guido}, year={2019}, pages={352–363} }'
chicago: 'Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm
for Scheduling Rescue Units during Disaster Response.” European Journal of
Operational Research 272, no. 1 (2019): 352–63.'
ieee: G. Rauchecker and G. Schryen, “An Exact Branch-and-Price Algorithm for Scheduling
Rescue Units during Disaster Response,” European Journal of Operational Research,
vol. 272, no. 1, pp. 352–363, 2019.
mla: Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm
for Scheduling Rescue Units during Disaster Response.” European Journal of
Operational Research, vol. 272, no. 1, Elsevier, 2019, pp. 352–63.
short: G. Rauchecker, G. Schryen, European Journal of Operational Research 272 (2019)
352–363.
date_created: 2018-11-14T15:35:27Z
date_updated: 2022-01-06T07:02:28Z
ddc:
- '000'
department:
- _id: '277'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:13:12Z
date_updated: 2018-12-13T15:16:37Z
file_id: '6019'
file_name: JOURNAL VERSION.pdf
file_size: 1470310
relation: main_file
file_date_updated: 2018-12-13T15:16:37Z
has_accepted_license: '1'
intvolume: ' 272'
issue: '1'
keyword:
- OR in disaster relief
- disaster operations management
- scheduling
- branch-and-price
language:
- iso: eng
oa: '1'
page: 352 - 363
publication: European Journal of Operational Research
publisher: Elsevier
status: public
title: An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster
Response
type: journal_article
user_id: '61579'
volume: 272
year: '2019'
...
---
_id: '6512'
abstract:
- lang: eng
text: Scheduling problems are essential for decision making in many academic disciplines,
including operations management, computer science, and information systems. Since
many scheduling problems are NP-hard in the strong sense, there is only limited
research on exact algorithms and how their efficiency scales when implemented
on parallel computing architectures. We address this gap by (1) adapting an exact
branch-and-price algorithm to a parallel machine scheduling problem on unrelated
machines with sequence- and machine-dependent setup times, (2) parallelizing the
adapted algorithm by implementing a distributed-memory parallelization with a
master/worker approach, and (3) conducting extensive computational experiments
using up to 960 MPI processes on a modern high performance computing cluster.
With our experiments, we show that the efficiency of our parallelization approach
can lead to superlinear speedup but can vary substantially between instances.
We further show that the wall time of serial execution can be substantially reduced
through our parallelization, in some cases from 94 hours to less than six minutes
when our algorithm is executed on 960 processes.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Rauchecker G, Schryen G. Using High Performance Computing for Unrelated Parallel
Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational
Evaluation of a Parallel Branch-and-Price Algorithm. Computers & Operations
Research. 2019;(104):338-357.'
apa: 'Rauchecker, G., & Schryen, G. (2019). Using High Performance Computing
for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times:
Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm.
Computers & Operations Research, (104), 338–357.'
bibtex: '@article{Rauchecker_Schryen_2019, title={Using High Performance Computing
for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times:
Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm},
number={104}, journal={Computers & Operations Research}, publisher={Elsevier},
author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={338–357}
}'
chicago: 'Rauchecker, Gerhard, and Guido Schryen. “Using High Performance Computing
for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times:
Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm.”
Computers & Operations Research, no. 104 (2019): 338–57.'
ieee: 'G. Rauchecker and G. Schryen, “Using High Performance Computing for Unrelated
Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and
Computational Evaluation of a Parallel Branch-and-Price Algorithm,” Computers
& Operations Research, no. 104, pp. 338–357, 2019.'
mla: 'Rauchecker, Gerhard, and Guido Schryen. “Using High Performance Computing
for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times:
Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm.”
Computers & Operations Research, no. 104, Elsevier, 2019, pp. 338–57.'
short: G. Rauchecker, G. Schryen, Computers & Operations Research (2019) 338–357.
date_created: 2019-01-08T13:50:44Z
date_updated: 2022-01-06T07:03:08Z
ddc:
- '000'
department:
- _id: '277'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2019-01-08T14:03:53Z
date_updated: 2019-01-08T14:03:53Z
file_id: '6513'
file_name: cor-parallel-bp-for-upmsp.pdf
file_size: 4153528
relation: main_file
file_date_updated: 2019-01-08T14:03:53Z
has_accepted_license: '1'
issue: '104'
keyword:
- parallel machine scheduling with setup times
- parallel branch-and-price algorithm
- high performance computing
- master/worker parallelization
language:
- iso: eng
oa: '1'
page: 338-357
publication: Computers & Operations Research
publisher: Elsevier
status: public
title: 'Using High Performance Computing for Unrelated Parallel Machine Scheduling
with Sequence-Dependent Setup Times: Development and Computational Evaluation of
a Parallel Branch-and-Price Algorithm'
type: journal_article
user_id: '61579'
year: '2019'
...
---
_id: '13443'
abstract:
- lang: eng
text: "This work considers the problem of control and resource allocation in networked\r\nsystems.
To this end, we present DIRA a Deep reinforcement learning based Iterative Resource\r\nAllocation
algorithm, which is scalable and control-aware. Our algorithm is tailored towards\r\nlarge-scale
problems where control and scheduling need to act jointly to optimize performance.\r\nDIRA
can be used to schedule general time-domain optimization based controllers. In
the present\r\nwork, we focus on control designs based on suitably adapted linear
quadratic regulators. We\r\napply our algorithm to networked systems with correlated
fading communication channels. Our\r\nsimulations show that DIRA scales well to
large scheduling problems."
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Daniel
full_name: Quevedo, Daniel
last_name: Quevedo
citation:
ama: 'Redder A, Ramaswamy A, Quevedo D. Deep reinforcement learning for scheduling
in large-scale networked control systems. In: Proceedings of the 8th IFAC Workshop
on Distributed Estimation and Control in Networked Systems. ; 2019.'
apa: Redder, A., Ramaswamy, A., & Quevedo, D. (2019). Deep reinforcement learning
for scheduling in large-scale networked control systems. In Proceedings of
the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems.
Chicago, USA.
bibtex: '@inproceedings{Redder_Ramaswamy_Quevedo_2019, title={Deep reinforcement
learning for scheduling in large-scale networked control systems}, booktitle={Proceedings
of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems},
author={Redder, Adrian and Ramaswamy, Arunselvan and Quevedo, Daniel}, year={2019}
}'
chicago: Redder, Adrian, Arunselvan Ramaswamy, and Daniel Quevedo. “Deep Reinforcement
Learning for Scheduling in Large-Scale Networked Control Systems.” In Proceedings
of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems,
2019.
ieee: A. Redder, A. Ramaswamy, and D. Quevedo, “Deep reinforcement learning for
scheduling in large-scale networked control systems,” in Proceedings of the
8th IFAC Workshop on Distributed Estimation and Control in Networked Systems,
Chicago, USA, 2019.
mla: Redder, Adrian, et al. “Deep Reinforcement Learning for Scheduling in Large-Scale
Networked Control Systems.” Proceedings of the 8th IFAC Workshop on Distributed
Estimation and Control in Networked Systems, 2019.
short: 'A. Redder, A. Ramaswamy, D. Quevedo, in: Proceedings of the 8th IFAC Workshop
on Distributed Estimation and Control in Networked Systems, 2019.'
conference:
end_date: 2019-09-17
location: Chicago, USA
name: 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems
- NECSYS 2019
start_date: 2019-09-16
date_created: 2019-09-23T16:00:58Z
date_updated: 2022-01-06T06:51:36Z
ddc:
- '620'
file:
- access_level: local
content_type: application/pdf
creator: aredder
date_created: 2019-09-23T15:48:33Z
date_updated: 2019-09-23T16:21:16Z
file_id: '13444'
file_name: ifacconf.pdf
file_size: 371429
relation: main_file
file_date_updated: 2019-09-23T16:21:16Z
has_accepted_license: '1'
keyword:
- Networked control systems
- deep reinforcement learning
- large-scale systems
- resource scheduling
- stochastic control
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.05992
oa: '1'
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control
in Networked Systems
publication_status: published
status: public
title: Deep reinforcement learning for scheduling in large-scale networked control
systems
type: conference
user_id: '52265'
year: '2019'
...
---
_id: '22'
abstract:
- lang: eng
text: This paper describes a data structure and a heuristic to plan and map arbitrary
resources in complex combinations while applying time dependent constraints. The
approach is used in the planning based workload manager OpenCCS at the Paderborn
Center for Parallel Computing (PC\(^2\)) to operate heterogeneous clusters with
up to 10000 cores. We also show performance results derived from four years of
operation.
author:
- first_name: Axel
full_name: Keller, Axel
id: '15274'
last_name: Keller
citation:
ama: 'Keller A. A Data Structure for Planning Based Workload Management of Heterogeneous
HPC Systems. In: Klusáček D, Cirne W, Desai N, eds. Proc. Workshop on Job Scheduling
Strategies for Parallel Processing (JSSPP). Vol 10773. Lecture Notes in Computer
Science. Springer; 2018:132-151. doi:10.1007/978-3-319-77398-8_8'
apa: 'Keller, A. (2018). A Data Structure for Planning Based Workload Management
of Heterogeneous HPC Systems. In D. Klusáček, W. Cirne, & N. Desai (Eds.),
Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)
(Vol. 10773, pp. 132–151). Orlando, FL, USA: Springer. https://doi.org/10.1007/978-3-319-77398-8_8'
bibtex: '@inproceedings{Keller_2018, series={Lecture Notes in Computer Science},
title={A Data Structure for Planning Based Workload Management of Heterogeneous
HPC Systems}, volume={10773}, DOI={10.1007/978-3-319-77398-8_8},
booktitle={Proc. Workshop on Job Scheduling Strategies for Parallel Processing
(JSSPP)}, publisher={Springer}, author={Keller, Axel}, editor={Klusáček, D. and
Cirne, W. and Desai, N.Editors}, year={2018}, pages={132–151}, collection={Lecture
Notes in Computer Science} }'
chicago: Keller, Axel. “A Data Structure for Planning Based Workload Management
of Heterogeneous HPC Systems.” In Proc. Workshop on Job Scheduling Strategies
for Parallel Processing (JSSPP), edited by D. Klusáček, W. Cirne, and N. Desai,
10773:132–51. Lecture Notes in Computer Science. Springer, 2018. https://doi.org/10.1007/978-3-319-77398-8_8.
ieee: A. Keller, “A Data Structure for Planning Based Workload Management of Heterogeneous
HPC Systems,” in Proc. Workshop on Job Scheduling Strategies for Parallel Processing
(JSSPP), Orlando, FL, USA, 2018, vol. 10773, pp. 132–151.
mla: Keller, Axel. “A Data Structure for Planning Based Workload Management of Heterogeneous
HPC Systems.” Proc. Workshop on Job Scheduling Strategies for Parallel Processing
(JSSPP), edited by D. Klusáček et al., vol. 10773, Springer, 2018, pp. 132–51,
doi:10.1007/978-3-319-77398-8_8.
short: 'A. Keller, in: D. Klusáček, W. Cirne, N. Desai (Eds.), Proc. Workshop on
Job Scheduling Strategies for Parallel Processing (JSSPP), Springer, 2018, pp.
132–151.'
conference:
end_date: 2017-06-02
location: Orlando, FL, USA
name: 21st Workshop on Job Scheduling Strategies for Parallel Processing
start_date: 2017-06-02
date_created: 2017-07-25T14:54:08Z
date_updated: 2022-01-06T06:55:22Z
department:
- _id: '27'
doi: 10.1007/978-3-319-77398-8_8
editor:
- first_name: D.
full_name: Klusáček, D.
last_name: Klusáček
- first_name: W.
full_name: Cirne, W.
last_name: Cirne
- first_name: N.
full_name: Desai, N.
last_name: Desai
intvolume: ' 10773'
keyword:
- Scheduling Planning Mapping Workload management
language:
- iso: eng
page: 132-151
publication: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)
publication_identifier:
isbn:
- 978-3-319-77398-8
- 978-3-319-77397-1
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Data Structure for Planning Based Workload Management of Heterogeneous HPC
Systems
type: conference
user_id: '15274'
volume: 10773
year: '2018'
...
---
_id: '5675'
abstract:
- lang: eng
text: When responding to natural disasters, professional relief units are often
supported by many volunteers which are not affiliated to humanitarian organizations.
The effective coordination of these volunteers is crucial to leverage their capabilities
and to avoid conflicts with professional relief units. In this paper, we empirically
identify key requirements that professional relief units pose on this coordination.
Based on these requirements, we suggest a decision model. We computationally solve
a real-world instance of the model and empirically validate the computed solution
in interviews with practitioners. Our results show that the suggested model allows
for solving volunteer coordination tasks of realistic size near-optimally within
short time, with the determined solution being well accepted by practitioners.
We also describe in this article how the suggested decision support model is integrated
in the volunteer coordination system which we develop in joint cooperation with
a disaster management authority and a software development company.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of
Spontaneous Volunteers in Disaster Relief. In: Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management. ; 2018.'
apa: Rauchecker, G., & Schryen, G. (2018). Decision Support for the Optimal
Coordination of Spontaneous Volunteers in Disaster Relief. In Proceedings of
the 15th International Conference on Information Systems for Crisis Response and
Management. Rochester, NY, USA.
bibtex: '@inproceedings{Rauchecker_Schryen_2018, title={Decision Support for the
Optimal Coordination of Spontaneous Volunteers in Disaster Relief}, booktitle={Proceedings
of the 15th International Conference on Information Systems for Crisis Response
and Management}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2018}
}'
chicago: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal
Coordination of Spontaneous Volunteers in Disaster Relief.” In Proceedings
of the 15th International Conference on Information Systems for Crisis Response
and Management, 2018.
ieee: G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination
of Spontaneous Volunteers in Disaster Relief,” in Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management, Rochester,
NY, USA, 2018.
mla: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination
of Spontaneous Volunteers in Disaster Relief.” Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management, 2018.
short: 'G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference
on Information Systems for Crisis Response and Management, 2018.'
conference:
location: Rochester, NY, USA
name: 15th International Conference on Information Systems for Crisis Response and
Management
date_created: 2018-11-14T15:35:54Z
date_updated: 2022-01-06T07:02:28Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:25:06Z
date_updated: 2018-12-13T15:05:44Z
file_id: '6020'
file_name: 2018_ISCRAM_Conference_Proceedings - Publication Version.pdf
file_size: 488472
relation: main_file
file_date_updated: 2018-12-13T15:05:44Z
has_accepted_license: '1'
keyword:
- Coordination of spontaneous volunteers
- volunteer coordination system
- decision support
- scheduling optimization model
- linear programming
language:
- iso: eng
oa: '1'
publication: Proceedings of the 15th International Conference on Information Systems
for Crisis Response and Management
status: public
title: Decision Support for the Optimal Coordination of Spontaneous Volunteers in
Disaster Relief
type: conference
user_id: '61579'
year: '2018'
...
---
_id: '48856'
abstract:
- lang: eng
text: There exist many optimal or heuristic priority rules for machine scheduling
problems, which can easily be integrated into single-objective evolutionary algorithms
via mutation operators. However, in the multi-objective case, simultaneously applying
different priorities for different objectives may cause severe disruptions in
the genome and may lead to inferior solutions. In this paper, we combine an existing
mutation operator concept with new insights from detailed observation of the structure
of solutions for multi-objective machine scheduling problems. This allows the
comprehensive integration of priority rules to produce better Pareto-front approximations.
We evaluate the extended operator concept compared to standard swap mutation and
the stand-alone components of our hybrid scheme, which performs best in all evaluated
cases.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
citation:
ama: 'Bossek J, Grimme C. An Extended Mutation-Based Priority-Rule Integration Concept
for Multi-Objective Machine Scheduling. In: 2017 IEEE Symposium Series on Computational
Intelligence (SSCI). ; 2017:1–8. doi:10.1109/SSCI.2017.8285224'
apa: Bossek, J., & Grimme, C. (2017). An Extended Mutation-Based Priority-Rule
Integration Concept for Multi-Objective Machine Scheduling. 2017 IEEE Symposium
Series on Computational Intelligence (SSCI), 1–8. https://doi.org/10.1109/SSCI.2017.8285224
bibtex: '@inproceedings{Bossek_Grimme_2017, title={An Extended Mutation-Based Priority-Rule
Integration Concept for Multi-Objective Machine Scheduling}, DOI={10.1109/SSCI.2017.8285224},
booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek,
Jakob and Grimme, Christian}, year={2017}, pages={1–8} }'
chicago: Bossek, Jakob, and Christian Grimme. “An Extended Mutation-Based Priority-Rule
Integration Concept for Multi-Objective Machine Scheduling.” In 2017 IEEE Symposium
Series on Computational Intelligence (SSCI), 1–8, 2017. https://doi.org/10.1109/SSCI.2017.8285224.
ieee: 'J. Bossek and C. Grimme, “An Extended Mutation-Based Priority-Rule Integration
Concept for Multi-Objective Machine Scheduling,” in 2017 IEEE Symposium Series
on Computational Intelligence (SSCI), 2017, pp. 1–8, doi: 10.1109/SSCI.2017.8285224.'
mla: Bossek, Jakob, and Christian Grimme. “An Extended Mutation-Based Priority-Rule
Integration Concept for Multi-Objective Machine Scheduling.” 2017 IEEE Symposium
Series on Computational Intelligence (SSCI), 2017, pp. 1–8, doi:10.1109/SSCI.2017.8285224.
short: 'J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence
(SSCI), 2017, pp. 1–8.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:36Z
department:
- _id: '819'
doi: 10.1109/SSCI.2017.8285224
extern: '1'
keyword:
- Evolutionary computation
- Processor scheduling
- Schedules
- Scheduling
- Sociology
- Standards
- Statistics
language:
- iso: eng
page: 1–8
publication: 2017 IEEE Symposium Series on Computational Intelligence (SSCI)
publication_status: published
status: public
title: An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective
Machine Scheduling
type: conference
user_id: '102979'
year: '2017'
...
---
_id: '17657'
abstract:
- lang: eng
text: Inter-datacenter transfers of non-interactive but timely large flows over
a private (managed) network is an important problem faced by many cloud service
providers. The considered flows are non-interactive because they do not explicitly
target the end users. However, most of them must be performed on a timely basis
and are associated with a deadline. We propose to schedule these flows by a centralized
controller, which determines when to transmit each flow and which path to use.
Two scheduling models are presented in this paper. In the first, the controller
also determines the rate of each flow, while in the second bandwidth is assigned
by the network according to the TCP rules. We develop scheduling algorithms for
both models and compare their complexity and performance.
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud
Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data
Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large
Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964},
number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R.
and Polevoy, Gleb}, year={2015}, pages={1–1} }'
chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data
Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.'
ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,”
Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”
Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1,
doi:10.1109/TCC.2015.2487964.
short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.
date_created: 2020-08-06T15:20:58Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TCC.2015.2487964
extern: '1'
issue: '99'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Cloud computing
- Routing
- Schedules
- Scheduling
language:
- iso: eng
page: 1-1
publication: Cloud Computing, IEEE Transactions on
publication_identifier:
issn:
- 2168-7161
status: public
title: Inter-Datacenter Scheduling of Large Data Flows
type: journal_article
user_id: '83983'
volume: PP
year: '2015'
...
---
_id: '5678'
abstract:
- lang: eng
text: Many academic disciplines - including information systems, computer science,
and operations management - face scheduling problems as important decision making
tasks. Since many scheduling problems are NP-hard in the strong sense, there is
a need for developing solution heuristics. For scheduling problems with setup
times on unrelated parallel machines, there is limited research on solution methods
and to the best of our knowledge, parallel computer architectures have not yet
been taken advantage of. We address this gap by proposing and implementing a new
solution heuristic and by testing different parallelization strategies. In our
computational experiments, we show that our heuristic calculates near-optimal
solutions even for large instances and that computing time can be reduced substantially
by our parallelization approach.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Rauchecker G, Schryen G. High-Performance Computing for Scheduling Decision
Support: A Parallel Depth-First Search Heuristic. In: Australasian Conference
on Information Systems. ; 2015:1-13.'
apa: 'Rauchecker, G., & Schryen, G. (2015). High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic. In Australasian
Conference on Information Systems (pp. 1–13).'
bibtex: '@inproceedings{Rauchecker_Schryen_2015, title={High-Performance Computing
for Scheduling Decision Support: A Parallel Depth-First Search Heuristic}, booktitle={Australasian
Conference on Information Systems}, author={Rauchecker, Gerhard and Schryen, Guido},
year={2015}, pages={1–13} }'
chicago: 'Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for
Scheduling Decision Support: A Parallel Depth-First Search Heuristic.” In Australasian
Conference on Information Systems, 1–13, 2015.'
ieee: 'G. Rauchecker and G. Schryen, “High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic,” in Australasian
Conference on Information Systems, 2015, pp. 1–13.'
mla: 'Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic.” Australasian Conference
on Information Systems, 2015, pp. 1–13.'
short: 'G. Rauchecker, G. Schryen, in: Australasian Conference on Information Systems,
2015, pp. 1–13.'
date_created: 2018-11-14T15:39:50Z
date_updated: 2022-01-06T07:02:30Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:40:18Z
date_updated: 2018-12-13T15:08:28Z
file_id: '6031'
file_name: ACIS_2015_paper_7.pdf
file_size: 6771871
relation: main_file
file_date_updated: 2018-12-13T15:08:28Z
has_accepted_license: '1'
keyword:
- scheduling
- decision support
- heuristic
- high performance computing
- parallel algorithms
language:
- iso: eng
oa: '1'
page: 1-13
publication: Australasian Conference on Information Systems
status: public
title: 'High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First
Search Heuristic'
type: conference
user_id: '61579'
year: '2015'
...
---
_id: '10779'
author:
- first_name: Zakarya
full_name: Guettatfi, Zakarya
last_name: Guettatfi
- first_name: Omar
full_name: Kermia, Omar
last_name: Kermia
- first_name: Abdelhakim
full_name: Khouas, Abdelhakim
last_name: Khouas
citation:
ama: 'Guettatfi Z, Kermia O, Khouas A. Over effective hard real-time hardware tasks
scheduling and allocation. In: 25th International Conference on Field Programmable
Logic and Applications (FPL). Imperial College; 2015. doi:10.1109/FPL.2015.7293994'
apa: Guettatfi, Z., Kermia, O., & Khouas, A. (2015). Over effective hard real-time
hardware tasks scheduling and allocation. In 25th International Conference
on Field Programmable Logic and Applications (FPL). Imperial College. https://doi.org/10.1109/FPL.2015.7293994
bibtex: '@inproceedings{Guettatfi_Kermia_Khouas_2015, title={Over effective hard
real-time hardware tasks scheduling and allocation}, DOI={10.1109/FPL.2015.7293994},
booktitle={25th International Conference on Field Programmable Logic and Applications
(FPL)}, publisher={Imperial College}, author={Guettatfi, Zakarya and Kermia, Omar
and Khouas, Abdelhakim}, year={2015} }'
chicago: Guettatfi, Zakarya, Omar Kermia, and Abdelhakim Khouas. “Over Effective
Hard Real-Time Hardware Tasks Scheduling and Allocation.” In 25th International
Conference on Field Programmable Logic and Applications (FPL). Imperial College,
2015. https://doi.org/10.1109/FPL.2015.7293994.
ieee: Z. Guettatfi, O. Kermia, and A. Khouas, “Over effective hard real-time hardware
tasks scheduling and allocation,” in 25th International Conference on Field
Programmable Logic and Applications (FPL), 2015.
mla: Guettatfi, Zakarya, et al. “Over Effective Hard Real-Time Hardware Tasks Scheduling
and Allocation.” 25th International Conference on Field Programmable Logic
and Applications (FPL), Imperial College, 2015, doi:10.1109/FPL.2015.7293994.
short: 'Z. Guettatfi, O. Kermia, A. Khouas, in: 25th International Conference on
Field Programmable Logic and Applications (FPL), Imperial College, 2015.'
date_created: 2019-07-10T12:11:36Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '78'
doi: 10.1109/FPL.2015.7293994
extern: '1'
keyword:
- embedded systems
- field programmable gate arrays
- operating systems (computers)
- scheduling
- μC/OS-II
- FPGAs
- OS foundation
- SafeRTOS
- Xenomai
- chip utilization ration
- complex time constraints
- embedded systems
- hard real-time hardware task allocation
- hard real-time hardware task scheduling
- hardware-software real-time operating systems
- partially reconfigurable field-programmable gate arrays
- resource constraints
- safety-critical RTOS
- Field programmable gate arrays
- Hardware
- Job shop scheduling
- Real-time systems
- Shape
- Software
language:
- iso: eng
publication: 25th International Conference on Field Programmable Logic and Applications
(FPL)
publication_identifier:
issn:
- 1946-147X
publisher: Imperial College
status: public
title: Over effective hard real-time hardware tasks scheduling and allocation
type: conference
user_id: '398'
year: '2015'
...
---
_id: '17663'
abstract:
- lang: eng
text: 'In this paper, we define and study a new problem, referred to as the Dependent
Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor networks, but we believe
it has important applications on the admission of large flows in other networks
as well. In order to optimize the selection of flows transmitted to the gateway,
D-UFP takes into account possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no good approximation is known.
Then, we address two special cases of this problem: the case where all the sensors
have a shared channel and the case where the sensors form a mesh and route to
the gateway over a spanning tree.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '37009'
abstract:
- lang: eng
text: Today, mobile and embedded real time systems have to cope with the migration
and allocation of multiple software tasks running on top of a real time operating
system (RTOS) residing on one or several processors. For scaling of each task
set and processor configuration, instruction set simulation and worst case timing
analysis are typically applied. This paper presents a complementary approach for
the verification of RTOS properties based on an abstract RTOS-Model in SystemC.
We apply IEEE P1850 PSL for which we present an approach and first experiences
for the assertion-based verification of RTOS properties.
author:
- first_name: Marcio F. S.
full_name: Oliveira, Marcio F. S.
last_name: Oliveira
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Oliveira MFS, Zabel H, Müller W. Assertion-Based Verification of RTOS Properties.
In: Proceedings of DATE’10. IEEE; 2010. doi:10.1109/DATE.2010.5457130'
apa: Oliveira, M. F. S., Zabel, H., & Müller, W. (2010). Assertion-Based Verification
of RTOS Properties. Proceedings of DATE’10. 2010 Design, Automation &
Test in Europe Conference & Exhibition (DATE 2010), Dresden. https://doi.org/10.1109/DATE.2010.5457130
bibtex: '@inproceedings{Oliveira_Zabel_Müller_2010, place={Dresden}, title={Assertion-Based
Verification of RTOS Properties}, DOI={10.1109/DATE.2010.5457130},
booktitle={Proceedings of DATE’10}, publisher={IEEE}, author={Oliveira, Marcio
F. S. and Zabel, Henning and Müller, Wolfgang}, year={2010} }'
chicago: 'Oliveira, Marcio F. S., Henning Zabel, and Wolfgang Müller. “Assertion-Based
Verification of RTOS Properties.” In Proceedings of DATE’10. Dresden: IEEE,
2010. https://doi.org/10.1109/DATE.2010.5457130.'
ieee: 'M. F. S. Oliveira, H. Zabel, and W. Müller, “Assertion-Based Verification
of RTOS Properties,” presented at the 2010 Design, Automation & Test in Europe
Conference & Exhibition (DATE 2010), Dresden, 2010, doi: 10.1109/DATE.2010.5457130.'
mla: Oliveira, Marcio F. S., et al. “Assertion-Based Verification of RTOS Properties.”
Proceedings of DATE’10, IEEE, 2010, doi:10.1109/DATE.2010.5457130.
short: 'M.F.S. Oliveira, H. Zabel, W. Müller, in: Proceedings of DATE’10, IEEE,
Dresden, 2010.'
conference:
location: Dresden
name: 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
date_created: 2023-01-17T09:15:10Z
date_updated: 2023-01-17T09:15:18Z
department:
- _id: '672'
doi: 10.1109/DATE.2010.5457130
keyword:
- Operating systems
- Real time systems
- Timing
- Hardware
- Analytical models
- Embedded software
- Software systems
- Processor scheduling
- Software performance
- Performance analysis
language:
- iso: eng
place: Dresden
publication: Proceedings of DATE’10
publisher: IEEE
status: public
title: Assertion-Based Verification of RTOS Properties
type: conference
user_id: '5786'
year: '2010'
...
---
_id: '33813'
abstract:
- lang: eng
text: "Today, mobile and embedded real-time systems have to cope with the migration\r\nand
allocation of multiple software tasks running on top of a real-time operating\r\nsystem
(RTOS) residing on one or several system processors. Each RTOS has to\r\nbe configured
towards the individual needs of the application and environment.\r\nFor this,
different scheduling strategies and task priorities have to be evaluated in\r\norder
to keep execution and response times for a given task set. Abstract RTOS\r\nsimulation
is applied to analyze different parameters in early design phases. This\r\nchapter
presents a SystemC RTOS library for abstract yet accurate RTOS sim-\r\nulation,
supporting modeling of preemption in the presence of prioritized and\r\nnested
interrupts. After introducing basic principles of abstract RTOS simula-\r\ntion,
we present our SystemC library in detail. Thereafter, we discuss related\r\napproaches
and close with applications in electronic automotive systems design\r\nand some
evaluations."
author:
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Andreas
full_name: Gerstlauer, Andreas
last_name: Gerstlauer
citation:
ama: 'Zabel H, Müller W, Gerstlauer A. Accurate RTOS Modelling and Analysis with
SystemC. In: Ecker W, Müller W, Dömer R, eds. Hardware Dependent Software -
Principles and Practice. Springer Verlag; 2009:233-260. doi:10.1007/978-1-4020-9436-1_9'
apa: Zabel, H., Müller, W., & Gerstlauer, A. (2009). Accurate RTOS Modelling
and Analysis with SystemC. In W. Ecker, W. Müller, & R. Dömer (Eds.), Hardware
Dependent Software - Principles and Practice (pp. 233–260). Springer Verlag.
https://doi.org/10.1007/978-1-4020-9436-1_9
bibtex: '@inbook{Zabel_Müller_Gerstlauer_2009, place={Dordrecht}, title={Accurate
RTOS Modelling and Analysis with SystemC}, DOI={10.1007/978-1-4020-9436-1_9},
booktitle={Hardware Dependent Software - Principles and Practice}, publisher={Springer
Verlag}, author={Zabel, Henning and Müller, Wolfgang and Gerstlauer, Andreas},
editor={Ecker, Wolfgang and Müller, Wolfgang and Dömer, Rainer}, year={2009},
pages={233–260} }'
chicago: 'Zabel, Henning, Wolfgang Müller, and Andreas Gerstlauer. “Accurate RTOS
Modelling and Analysis with SystemC.” In Hardware Dependent Software - Principles
and Practice, edited by Wolfgang Ecker, Wolfgang Müller, and Rainer Dömer,
233–60. Dordrecht: Springer Verlag, 2009. https://doi.org/10.1007/978-1-4020-9436-1_9.'
ieee: 'H. Zabel, W. Müller, and A. Gerstlauer, “Accurate RTOS Modelling and Analysis
with SystemC,” in Hardware Dependent Software - Principles and Practice,
W. Ecker, W. Müller, and R. Dömer, Eds. Dordrecht: Springer Verlag, 2009, pp.
233–260.'
mla: Zabel, Henning, et al. “Accurate RTOS Modelling and Analysis with SystemC.”
Hardware Dependent Software - Principles and Practice, edited by Wolfgang
Ecker et al., Springer Verlag, 2009, pp. 233–60, doi:10.1007/978-1-4020-9436-1_9.
short: 'H. Zabel, W. Müller, A. Gerstlauer, in: W. Ecker, W. Müller, R. Dömer (Eds.),
Hardware Dependent Software - Principles and Practice, Springer Verlag, Dordrecht,
2009, pp. 233–260.'
date_created: 2022-10-18T10:45:06Z
date_updated: 2022-10-18T10:55:55Z
department:
- _id: '672'
doi: 10.1007/978-1-4020-9436-1_9
editor:
- first_name: Wolfgang
full_name: Ecker, Wolfgang
last_name: Ecker
- first_name: Wolfgang
full_name: Müller, Wolfgang
last_name: Müller
- first_name: Rainer
full_name: Dömer, Rainer
last_name: Dömer
keyword:
- RTOS Modelling
- RTOS Simulation
- SystemC
- Task Scheduling
- Interrupt Analysis
language:
- iso: eng
page: 233-260
place: Dordrecht
publication: Hardware Dependent Software - Principles and Practice
publication_identifier:
isbn:
- 978-1-4020-9435-4
publisher: Springer Verlag
status: public
title: Accurate RTOS Modelling and Analysis with SystemC
type: book_chapter
user_id: '5786'
year: '2009'
...
---
_id: '37066'
abstract:
- lang: eng
text: Today, mobile and embedded real-time systems have to cope with the migration
and allocation of multiple software tasks running on top of a real-time operating
system (RTOS) residing on one or multiple system processors. Abstract RTOS simulations
and timing analysis applies for fast and early estimation to configure it towards
the individual needs of the application and environment. In this context, a high
accuracy of the simulation compared to an instruction set simulation (ISS) is
of key importance. In this paper, we investigate the accuracy of abstract RTOS
simulation and compare it to ISS and the behavior of the physical system. We show
that we can reach an increased accuracy of the simulation when we inject noise
into the time model. Our results indicate that it is sufficient to inject uniformly
distributed random time values to the RTOS real-time clock.
author:
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Zabel H, Müller W. Increased Accuracy through Noise Injection in Abstract
RTOS Simulation. In: Proceedings of DATE’09. ; 2009. doi:10.1109/DATE.2009.5090925'
apa: Zabel, H., & Müller, W. (2009). Increased Accuracy through Noise Injection
in Abstract RTOS Simulation. Proceedings of DATE’09. Design, Automation
& Test in Europe Conference & Exhibition. https://doi.org/10.1109/DATE.2009.5090925
bibtex: '@inproceedings{Zabel_Müller_2009, place={Nice, France}, title={Increased
Accuracy through Noise Injection in Abstract RTOS Simulation}, DOI={10.1109/DATE.2009.5090925},
booktitle={Proceedings of DATE’09}, author={Zabel, Henning and Müller, Wolfgang},
year={2009} }'
chicago: Zabel, Henning, and Wolfgang Müller. “Increased Accuracy through Noise
Injection in Abstract RTOS Simulation.” In Proceedings of DATE’09. Nice,
France, 2009. https://doi.org/10.1109/DATE.2009.5090925.
ieee: 'H. Zabel and W. Müller, “Increased Accuracy through Noise Injection in Abstract
RTOS Simulation,” presented at the Design, Automation & Test in Europe Conference
& Exhibition, 2009, doi: 10.1109/DATE.2009.5090925.'
mla: Zabel, Henning, and Wolfgang Müller. “Increased Accuracy through Noise Injection
in Abstract RTOS Simulation.” Proceedings of DATE’09, 2009, doi:10.1109/DATE.2009.5090925.
short: 'H. Zabel, W. Müller, in: Proceedings of DATE’09, Nice, France, 2009.'
conference:
name: Design, Automation & Test in Europe Conference & Exhibition
date_created: 2023-01-17T11:51:44Z
date_updated: 2023-01-17T11:51:48Z
department:
- _id: '672'
doi: 10.1109/DATE.2009.5090925
keyword:
- Timing
- Analytical models
- Clocks
- Performance analysis
- Scheduling
- Operating systems
- Delay
- Real time systems
- Application software
- Context modeling
language:
- iso: eng
place: Nice, France
publication: Proceedings of DATE'09
publication_identifier:
isbn:
- 978-1-4244-3781-8
status: public
title: Increased Accuracy through Noise Injection in Abstract RTOS Simulation
type: conference
user_id: '5786'
year: '2009'
...
---
_id: '10646'
author:
- first_name: Klaus
full_name: Danne, Klaus
last_name: Danne
- first_name: Roland
full_name: Mühlenbernd, Roland
last_name: Mühlenbernd
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Danne K, Mühlenbernd R, Platzner M. Server-based execution of periodic tasks
on dynamically reconfigurable hardware. IET Computers Digital Techniques.
2007;1(4):295-302. doi:10.1049/iet-cdt:20060186
apa: Danne, K., Mühlenbernd, R., & Platzner, M. (2007). Server-based execution
of periodic tasks on dynamically reconfigurable hardware. IET Computers Digital
Techniques, 1(4), 295–302. https://doi.org/10.1049/iet-cdt:20060186
bibtex: '@article{Danne_Mühlenbernd_Platzner_2007, title={Server-based execution
of periodic tasks on dynamically reconfigurable hardware}, volume={1}, DOI={10.1049/iet-cdt:20060186},
number={4}, journal={IET Computers Digital Techniques}, author={Danne, Klaus and
Mühlenbernd, Roland and Platzner, Marco}, year={2007}, pages={295–302} }'
chicago: 'Danne, Klaus, Roland Mühlenbernd, and Marco Platzner. “Server-Based Execution
of Periodic Tasks on Dynamically Reconfigurable Hardware.” IET Computers Digital
Techniques 1, no. 4 (2007): 295–302. https://doi.org/10.1049/iet-cdt:20060186.'
ieee: K. Danne, R. Mühlenbernd, and M. Platzner, “Server-based execution of periodic
tasks on dynamically reconfigurable hardware,” IET Computers Digital Techniques,
vol. 1, no. 4, pp. 295–302, 2007.
mla: Danne, Klaus, et al. “Server-Based Execution of Periodic Tasks on Dynamically
Reconfigurable Hardware.” IET Computers Digital Techniques, vol. 1, no.
4, 2007, pp. 295–302, doi:10.1049/iet-cdt:20060186.
short: K. Danne, R. Mühlenbernd, M. Platzner, IET Computers Digital Techniques 1
(2007) 295–302.
date_created: 2019-07-10T11:10:54Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
doi: 10.1049/iet-cdt:20060186
intvolume: ' 1'
issue: '4'
keyword:
- reconfigurable architectures
- resource allocation
- device reconfiguration time
- dynamic hardware reconfiguration
- dynamically reconfigurable hardware
- light-weight runtime system
- merge server distribute load
- periodic real-time tasks
- runtime system overheads
- schedulability analysis
- scheduling technique
- server-based execution
- synthesis tool flow
language:
- iso: eng
page: 295-302
publication: IET Computers Digital Techniques
publication_identifier:
issn:
- 1751-8601
status: public
title: Server-based execution of periodic tasks on dynamically reconfigurable hardware
type: journal_article
user_id: '3118'
volume: 1
year: '2007'
...
---
_id: '39526'
abstract:
- lang: eng
text: The main goal of the article is to evaluate the suitability of visual programming
languages, i.e., Pictorial Janus (K. Kahn and V. Saraswat, 1990), for the modeling
of complex systems and their control strategies. These systems can be seen as
networks of communicating objects. Objects select strategies for suitable actions
based on incoming messages. Our field of investigation is in computer integrated
manufacturing considering the example of a car manufacturing cell. This color
sorting assembly buffer (CSAB) schedules jobs in queues. The jobs represent car
bodies scheduled in feeder lines for the enameling. Feeder lines collect raw bodies
to blocks. Blocks are bodies which are to be enameled by the same color. This
organization decreases the cost of expensive change-over-times when changing colors
at the enamelling. Blocks of bodies are dislocated from the queue and enameled
successively. Contradictory system goals, such as minimizing color changes and
preserving the sequence of incoming jobs, have to be regarded by appropriate control
strategies. Due to the complexity of this (NP complete) problem and to real time
requirements for online control there are no optimal strategies on hand. Consequently,
suitable heuristics have to be developed. Often they are designed applying a trial-and-error
method. A modeling framework has to support the rapid prototyping of these systems
as well as an expressive end user oriented representation. Both are essential
requirements since end users need other visualization techniques than experienced
designers due to their different knowledge and interests.
author:
- first_name: Christian
full_name: Geiger, Christian
last_name: Geiger
- first_name: R.
full_name: Hunstock, R.
last_name: Hunstock
- first_name: Georg
full_name: Lehrenfeld, Georg
last_name: Lehrenfeld
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: 'J. '
full_name: 'Quintanilla, J. '
last_name: Quintanilla
- first_name: 'C. '
full_name: 'Tahedl, C. '
last_name: Tahedl
- first_name: A.
full_name: Weber, A.
last_name: Weber
citation:
ama: 'Geiger C, Hunstock R, Lehrenfeld G, et al. Visual Modeling and 3D-Representation
with a Complete Visual Programming Language --- A Case Study in Manufacturing.
In: Proceedings of the 1996 IEEE Symposium on Visual Languages. ; 1996.
doi:10.1109/VL.1996.545302'
apa: Geiger, C., Hunstock, R., Lehrenfeld, G., Müller, W., Quintanilla, J., Tahedl,
C., & Weber, A. (1996). Visual Modeling and 3D-Representation with a Complete
Visual Programming Language --- A Case Study in Manufacturing. Proceedings
of the 1996 IEEE Symposium on Visual Languages. https://doi.org/10.1109/VL.1996.545302
bibtex: '@inproceedings{Geiger_Hunstock_Lehrenfeld_Müller_Quintanilla_Tahedl_Weber_1996,
place={Boulder, CO, USA}, title={Visual Modeling and 3D-Representation with a
Complete Visual Programming Language --- A Case Study in Manufacturing}, DOI={10.1109/VL.1996.545302}, booktitle={Proceedings
of the 1996 IEEE Symposium on Visual Languages}, author={Geiger, Christian and
Hunstock, R. and Lehrenfeld, Georg and Müller, Wolfgang and Quintanilla, J. and
Tahedl, C. and Weber, A.}, year={1996} }'
chicago: Geiger, Christian, R. Hunstock, Georg Lehrenfeld, Wolfgang Müller, J. Quintanilla,
C. Tahedl, and A. Weber. “Visual Modeling and 3D-Representation with a Complete
Visual Programming Language --- A Case Study in Manufacturing.” In Proceedings
of the 1996 IEEE Symposium on Visual Languages. Boulder, CO, USA, 1996. https://doi.org/10.1109/VL.1996.545302.
ieee: 'C. Geiger et al., “Visual Modeling and 3D-Representation with a Complete
Visual Programming Language --- A Case Study in Manufacturing,” 1996, doi: 10.1109/VL.1996.545302.'
mla: Geiger, Christian, et al. “Visual Modeling and 3D-Representation with a Complete
Visual Programming Language --- A Case Study in Manufacturing.” Proceedings
of the 1996 IEEE Symposium on Visual Languages, 1996, doi:10.1109/VL.1996.545302.
short: 'C. Geiger, R. Hunstock, G. Lehrenfeld, W. Müller, J. Quintanilla, C. Tahedl,
A. Weber, in: Proceedings of the 1996 IEEE Symposium on Visual Languages, Boulder,
CO, USA, 1996.'
date_created: 2023-01-24T11:58:56Z
date_updated: 2023-01-24T11:59:01Z
department:
- _id: '672'
doi: 10.1109/VL.1996.545302
keyword:
- Computer integrated manufacturing
- Job shop scheduling
- Processor scheduling
- Computer languages
- Control system synthesis
- Computer aided manufacturing
- Sorting
- Assembly
- Costs
- Control systems
language:
- iso: eng
place: Boulder, CO, USA
publication: Proceedings of the 1996 IEEE Symposium on Visual Languages
publication_identifier:
isbn:
- 0-8186-7508-X
status: public
title: Visual Modeling and 3D-Representation with a Complete Visual Programming Language
--- A Case Study in Manufacturing
type: conference
user_id: '5786'
year: '1996'
...