A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Authors:
Purushothaman Damodaran;Mario C. Vélez-Gallego
Affiliations:
Department of Industrial and Systems Engineering, Northern Illinois University, DeKalb, IL 60115, USA;Departamento de Ingeniería de Producción, Universidad EAFIT, Carrera 49, 7 sur 50, Medellín, Colombia
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 10
Cited 3

Job shop scheduling by simulated annealing

Operations Research
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Resource constrained scheduling on multiple machines

Information Processing Letters
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research
Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
Note: Minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics
Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines

Engineering Applications of Artificial Intelligence
A GRASP approach for makespan minimization on parallel batch processing machines

Journal of Intelligent Manufacturing

Capacitated location-routing problem with time windows under uncertainty

Knowledge-Based Systems
A simulated annealing heuristic for minimizing makespan in parallel machine scheduling

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Scheduling unrelated parallel batch processing machines with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	12.05

Visualization

Abstract

A simulated annealing (SA) algorithm to minimize the makespan on a group of identical batch processing machines arranged in parallel is presented. We consider the case where each job has an arbitrary processing time, non-identical size, and non-zero ready time. Each machine can process simultaneously several jobs as a batch as long as the machine capacity is not exceeded. The batch processing time is equal to the largest processing time among those jobs in the batch. Similarly, the batch ready time is equal to the largest ready time among all the jobs in the batch. Random instances were used to compare the results of the SA approach against a lower bound, a mathematical model, and two heuristics published in the literature: the Modified Delay (MD) heuristic and a Greedy Randomized Adaptive Search Procedure (GRASP). Computational experiments showed that the SA approach is comparable to GRASP with respect to solution quality, and less computationally costly. Both SA and GRASP comfortably outperformed the MD heuristic.