Minimising earliness and tardiness on parallel machines with sequence-dependent setups
type: Item
instance of: scholarly article
title: Minimising earliness and tardiness on parallel machines with sequence-dependent setups
zbMATH Open document ID: 1188.90102
DOI: 10.1504/IJOR.2010.033103
author: Ghazi M. Magableh
author: Scott J. Mason
published in: International Journal of Operational Research
publication date: 2010-05-31T00:00:00Z
review text: Summary: We present heuristics for minimising total earliness and tardiness on a group of identical, parallel machines subject to sequence-dependent setups. Each job has a potentially unique due date, processing time and/or ready time. Our approach generates an initial feasible schedule using new algorithms and a dispatching rule, and then employs a local search procedure to improve this initial schedule when possible. Experimental results demonstrate the viability of our approach over a wide range of problem instances to produce near-optimal solutions in practically acceptable computation times.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5714255
zbMATH Keywords: earliness
zbMATH Keywords: tardiness
zbMATH Keywords: parallel machines
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: sequence-dependent setups
zbMATH Keywords: dispatching rules
zbMATH Keywords: due dates
MaRDI profile type: Publication
full work available at URL: ijor.2010.033103
OpenAlex ID: W2109947313
description: scientific article; zbMATH DE number 5714255