Fast Approximation for Scheduling One Machine

Fast Approximation for Scheduling One Machine

We propose an approximation algorithm for scheduling jobs with release and delivery times on a single machine with the objective to minimize the makespan. The algorithm is based on an implicit enumeration of the set of complete solutions in a search tree. By analyzing specific structural properties...

Full description

Bibliographic Details
Main Authors: Federico Alonso-Pecina, José Alberto Hernández, José Maria Sigarreta, Nodari Vakhania
Format: Article
Language:English
Published: MDPI AG 2020-09-01
Series:Mathematics
Subjects:
scheduling algorithm
enumeration
approximation
release time
due-date
delivery time
Online Access:https://www.mdpi.com/2227-7390/8/9/1524

Similar Items

Similar Items