Title

A Heuristic Algorithm For The Just-In-Time Single Machine Scheduling Problem With Setups: A Comparison With Simulated Annealing

Keywords

Common due date; Early-tardy problem; Scheduling; Setup time; Simulated annealing; Single machine

Abstract

This paper addresses the single machine early/tardy problem with unrestricted common due date and sequence-dependent setup times. Two algorithms are introduced to reach near-optimum solutions: the SAPT, a heuristic tailored for the problem, and a simulated annealing (SA) algorithm. It will be shown that SA provides solutions with slightly better quality; however, SAPT requires much less computational time. SAPT-SA is a hybrid heuristic that combines both approaches to obtain high quality solutions with low computational cost. Solutions provided by the three algorithms were compared to optimal solutions for problems with up to 25 jobs and to each other for larger problems. © Springer-Verlag London Limited 2007.

Publication Date

3-1-2007

Publication Title

International Journal of Advanced Manufacturing Technology

Volume

32

Issue

3-4

Number of Pages

326-335

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1007/s00170-005-0333-1

Socpus ID

33847274758 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS