A job shop scheduling with set-up time

A job shop scheduling with set-up time

0.00 Avg rating0 Votes
Article ID: iaor19941442
Country: Belgium
Volume: 33
Issue: 1/2
Start Page Number: 103
End Page Number: 117
Publication Date: Jan 1993
Journal: Belgian Journal of Operations Research, Statistics and Computer Science
Authors:
Keywords: heuristics
Abstract:

Job shop scheduling is a well-known NP-hard problem. This paper considers such a problem with class-dependent set-up time. It uses several heuristics to solve this problem: genetic algorithms, tabu search and a learning classifier system.

Reviews

Required fields are marked *. Your email address will not be published.