A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Authors:
Krzysztof Fleszar;Christoforos Charalambous;Khalil S. Hindi
Affiliations:
Olayan School of Business, American University of Beirut (AUB), Beirut, Lebanon 1107 2020;Department of Computer Science and Engineering, Frederick University, Nicosia, Cyprus 1303;Olayan School of Business, American University of Beirut (AUB), Beirut, Lebanon 1107 2020
Venue:
Journal of Intelligent Manufacturing
Year:
2012

Citing 16
Cited 2

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Exact and approximation algorithms for makespan minimization on unrelated parallel machines

Discrete Applied Mathematics
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Variable Neighborhood Decomposition Search

Journal of Heuristics
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms
Creating very large scale neighborhoods out of smaller ones by compounding moves

Journal of Heuristics
Scheduling unrelated parallel machines with sequence-dependent setups

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

Computers and Operations Research
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

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

Scheduling: Theory, Algorithms, and Systems
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model

Transportation Science
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters

Exact and approximate methods for parallel multiple-area spatial scheduling with release times

OR Spectrum
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The NP-hard problem of scheduling jobs on unrelated parallel machines, in the presence of machine-dependent and sequence-dependent setup times, with the objective of minimizing the makespan, is considered. A variable neighborhood descent search algorithm, hybridized with mathematical programming elements, is presented and its performance is evaluated on a large set of benchmark problem instances. The extensive computational experiments show that the proposed algorithm outperforms previously proposed methods in terms of solution quality as well as computation time.