Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

Authors:
João Paulo De C. M. Nogueira;José Elias C. Arroyo;Harlem Mauricio M. Villadiego;Luciana B. Gonçalves
Affiliations:
-;-;-;-
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2014

Citing 20
Cited 0

Sequencing with earliness and tardiness penalties: a review

Operations Research
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
Exact and approximation algorithms for makespan minimization on unrelated parallel machines

Discrete Applied Mathematics
Multiple-machine scheduling with earliness, tardiness and completion time penalties

Computers and Operations Research
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

Electronic Notes in Theoretical Computer Science (ENTCS)
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Mathematical and Computer Modelling: An International Journal
Unrelated parallel machine scheduling using local search

Mathematical and Computer Modelling: An International Journal
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Mathematical and Computer Modelling: An International Journal
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers and Operations Research
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers an unrelated parallel machine scheduling problem with the objective of minimizing the total earliness and tardiness penalties. Machine and job-sequence dependent setup times and idle times are considered. Since the studied problem is NP-Hard, we test the applicability of algorithms based on Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic to determine near-optimal solutions. We propose three different heuristics. The first is a simple GRASP heuristic, the second heuristic includes an intensification procedure based on Path Relinking technique, and the third uses an Iterated Local Search (ILS) heuristic in the local search phase of the GRASP algorithm. The results obtained by the heuristics are compared using a set of small, medium and large instances. Comprehensive computational and statistical analyses are carried out in order to compare the performance of the algorithms.