Scheduling a Single Machine with Primary and Secondary Objectives
AbstractWe study a scheduling problem in which jobs with release times and due dates are to be processed on a single machine. With the primary objective to minimize the maximum job lateness, the problem is strongly NP-hard. We describe a general algorithmic scheme to minimize the maximum job lateness, with the secondary objective to minimize the maximum job completion time. The problem of finding the Pareto-optimal set of feasible solutions with these two objective criteria is strongly NP-hard. We give the dominance properties and conditions when the Pareto-optimal set can be formed in polynomial time. These properties, together with our general framework, provide the theoretical background, so that the basic framework can be expanded to (exponential-time) implicit enumeration algorithms and polynomial-time approximation algorithms (generating the Pareto sub-optimal frontier with a fair balance between the two objectives). Some available in the literature experimental results confirm the practical efficiency of the proposed framework. View Full-Text
Share & Cite This Article
Vakhania, N. Scheduling a Single Machine with Primary and Secondary Objectives. Algorithms 2018, 11, 80.
Vakhania N. Scheduling a Single Machine with Primary and Secondary Objectives. Algorithms. 2018; 11(6):80.Chicago/Turabian Style
Vakhania, Nodari. 2018. "Scheduling a Single Machine with Primary and Secondary Objectives." Algorithms 11, no. 6: 80.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.