On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty

On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty

In this paper, we consider the single-machine scheduling problem with given release dates and the objective to minimize the maximum penalty which is NP-hard in the strong sense. For this problem, we introduce a dual and an inverse problem and show that both these problems can be solved in polynomial...

Full description

Bibliographic Details
Main Authors: Alexander A. Lazarev, Nikolay Pravdivets, Frank Werner
Format: Article
Language:English
Published: MDPI AG 2020-07-01
Series:Mathematics
Subjects:
single-machine scheduling
minimization of maximum penalty
dual problem
inverse problem
branch and bound
Online Access:https://www.mdpi.com/2227-7390/8/7/1131

Similar Items

Similar Items