Julius Hoffmann

Julius Hoffmann
  • Diplom
  • Research Assistant at Karlsruhe Institute of Technology

Research Associate

About

3
Publications
259
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
4
Citations
Introduction
I am a Research Associate at the Karlsruhe Institute of Technology (KIT) and completed my studies at Technische Universität Dresden and the University of Wisconsin-Madison, focusing on optimization, information technology and communication engineering. In my diploma thesis, I investigated the customer order scheduling problem and belonging heuristics, while my current research is centered on applying game theory to location problems and spatial interaction models.
Current institution
Karlsruhe Institute of Technology
Current position
  • Research Assistant

Publications

Publications (3)
Article
Full-text available
The customer order scheduling problem has garnered considerable attention in the recent scheduling literature. It is assumed that each of several customer orders consists of several jobs, and each customer order is completed only if each job of the order is completed. In this paper, we consider the customer order scheduling problem in a machine env...
Chapter
In this paper, three configurations of the customer order scheduling problem are presented. In contrast to classical scheduling problems, the customer order scheduling problem considers the scheduling of jobs that belong to customer orders and each order is only completed when each job of the order has finished. The studied configurations are the m...
Article
The customer order scheduling problem has received much attention recently due to its relevance to real world applications. In this study, the minimization of the total completion time of customer orders is studied in a dedicated machine environment, i.e. each order consists of one job on each machine. Two iterated greedy algorithms are presented t...

Network

Cited By