Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

A single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness is examined. A mathematical formulation of the problem is first presented and several important properties are studied to facilitate the solution process. An optimal timing algorithm is t...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2002-10, Vol.142 (2), p.271-281
Main Authors: Wan, Guohua, Yen, Benjamin P.-C.
Format: Article
Language:English
Subjects:
Earliness and tardiness
Job shops
Mathematical models
Operations research
Scheduling
Single machine
Studies
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness is examined. A mathematical formulation of the problem is first presented and several important properties are studied to facilitate the solution process. An optimal timing algorithm is then proposed to determine completion times for each job in a given job sequence. A Tabu search (TS) procedure is employed together with the optimal timing algorithm to generate job sequences and final schedules. Computational experiments indicate that the performance of the proposed approach is quite well, especially for the instances of large size.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00302-2