Heuristic Algorithm for Minimizing Total Earliness/Tardiness on Parallel Machines with Sequence-Dependent Setups and Ready Times

In this paper, we present heuristics for minimizing total earliness/tardiness on a group of identical parallel machines subject to sequence-dependent setups. Each job has its own unique due date, processing time, and ready time. Our approach generates an initial feasible schedule using new heuristic...

Full description

Saved in:
Bibliographic Details
Published inIISE Annual Conference. Proceedings p. 1
Main Author Magableh, Ghazi M
Format Journal Article
LanguageEnglish
Published Norcross Institute of Industrial and Systems Engineers (IISE) 01.01.2004
Subjects
Heuristic
Queuing theory
Scheduling algorithms
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present heuristics for minimizing total earliness/tardiness on a group of identical parallel machines subject to sequence-dependent setups. Each job has its own unique due date, processing time, and ready time. Our approach generates an initial feasible schedule using new heuristic rule, and then employs a local search procedure to improve upon this initial schedule when possible. Computational experiments demonstrate that our approach is both fast and effective. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14