|
Discrete mathematics and mathematical cybernetics
Minimizing total completion time on parallel machines with unit length jobs that need one additional resource
V. A. Strusevich Sherwood Road, Welling, Kent, DA16 2SJ, U.K.
Abstract:
The paper considers a scheduling problem on parallel identical machines to minimize the sum of the completion times. All jobs are of unit length and require one unit of one of the additional resources. We offer an algorithm that is much faster and simpler than previously available.
Keywords:
resource constrained scheduling, unit length jobs, total completion time, parallel identical machines.
Received April 27, 2022, published August 30, 2022
Citation:
V. A. Strusevich, “Minimizing total completion time on parallel machines with unit length jobs that need one additional resource”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 601–612
Linking options:
https://www.mathnet.ru/eng/semr1524 https://www.mathnet.ru/eng/semr/v19/i2/p601
|
|