Developing New Bounds for the Performance Guarantee of the Jump Neighborhood for Scheduling Jobs on Uniformly Related Machines
This study investigates the worst-case performance guarantee of locally optimal solutions to minimize the total weighted completion time on uniformly related parallel machines. The investigated neighborhood structure is Jump, also called insertion or move. This research focused on establishing the l...
Main Authors: | Felipe T. Muñoz, Guillermo Latorre-Núñez, Mario Ramos-Maldonado |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/1/6 |
Similar Items
-
Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling
by: Khaled Bamatraf, et al.
Published: (2024-06-01) -
A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Jobshop Scheduling With an Assembly Stage
by: Parviz Fattahi, et al.
Published: (2019-03-01) -
Valuation of Cliquet-Style Guarantees with Death Benefits in Jump Diffusion Models
by: Yaodi Yong, et al.
Published: (2021-08-01) -
Finite-Time Guaranteed Cost Control for Markovian Jump Systems with Time-Varying Delays
by: Xikui Liu, et al.
Published: (2022-06-01) -
Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm
by: Lirui Xue, et al.
Published: (2024-03-01)