Page 1

Displaying 1 – 6 of 6

Showing per page

Job shop scheduling with unit length tasks

Meike Akveld, Raphael Bernhard (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm...

Job shop scheduling with unit length tasks

Meike Akveld, Raphael Bernhard (2012)

RAIRO - Theoretical Informatics and Applications

In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal...

Currently displaying 1 – 6 of 6

Page 1