Title

A Metaheuristic For The Early/Tardy Single Machine Scheduling Problem

Keywords

Early tardy problem; Meta-heuristics; Single machine scheduling

Abstract

This paper addresses the Early/Tardy Single Machine Scheduling Problem with Common Due Date and Sequence-Dependent Setup Times (ETP). The objective of this problem is to minimize the total amount of earliness and tardiness of jobs that are assigned to a single machine. ETP in this research is solved by Meta-RaPS (Meta-heuristic for Randomized Priority Search) which is a typical multi-start meta-heuristic. Results for several ETP test problems show the Meta-RaPS ETP method produces high quality solutions in reasonable computation time when compared to other ETP techniques found in the literature.

Publication Date

12-1-2006

Publication Title

2006 IIE Annual Conference and Exhibition

Number of Pages

-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

36448954333 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/36448954333

This document is currently not available here.

Share

COinS