On Scheduling Problems with Forbidden Stack-Overflows

Frank Werner1, Evgeny R. Gafarov2

  • 1Otto-von-Guericke-University Magdeburg
  • 2Institute of Control Sciences of the Russian Academy ofSciences

Details

Category

Open Invited Track

Sessions

11:00 - 12:28 | Wed 28 Aug | 014 | WeAT5

Planning and Scheduling of Manufacturing Processes

Full Text

Abstract

In this paper, we consider some special resource-constrained scheduling problems, which occur e.g. in production or in computer science. We consider the minimization of the makespan as well as total tardiness. Some complexity and approximability results are given as well as relationships to other scheduling problems.

Additional Information

No information added

Video

No videos found