A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based o...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1997-11, Vol.102 (3), p.513-527
Main Authors: James, R.J.W., Buchanan, J.T.
Format: Article
Language:English
Subjects:
Applied sciences
Early/tardy
Exact sciences and technology
Heuristic
Heuristics
Job shops
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Scheduling
Scheduling, sequencing
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:The single machine, distinct due date, early/tardy machine scheduling problem closely models the situation faced by Just-In-Time manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the concept of a ‘compressed solution space’, based on a binary representation of the early/tardy scheduling problem, and tabu search. A heuristic which simultaneously sequences and schedules the jobs is developed to perform the conversion between the compressed and physical solution spaces. Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(96)00239-1