Minimizing Weighted Earliness/Tardiness on Parallel Machines with Sequence-Dependent Setups

In this paper, we present a heuristic for minimizing total earliness/tardiness on a group of identical parallel machines subject to sequence-dependent setups and different release times. Our approach generates an initial feasible schedule using a new heuristic rule, then employs a local search proce...

Full description

Saved in:
Bibliographic Details
Published inIISE Annual Conference. Proceedings p. 1
Main Authors Magableh, Ghazi M, Mason, Scott J
Format Journal Article
LanguageEnglish
Published Norcross Institute of Industrial and Systems Engineers (IISE) 01.01.2003
Subjects
Heuristic
Industrial engineering
Production scheduling
Scheduling algorithms
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a heuristic for minimizing total earliness/tardiness on a group of identical parallel machines subject to sequence-dependent setups and different release times. Our approach generates an initial feasible schedule using a new heuristic rule, then employs a local search procedure to improve upon this initial schedule when possible. Experimental results demonstrate the viability of our approach over a wide range of problem instances. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14