A search space analysis of the Job Shop Scheduling Problem

A search space analysis of the Job Shop Scheduling Problem

0.00 Avg rating0 Votes
Article ID: iaor2000146
Country: Netherlands
Volume: 86
Issue: 1
Start Page Number: 441
End Page Number: 453
Publication Date: Mar 1999
Journal: Annals of Operations Research
Authors: , ,
Keywords: job shop
Abstract:

A computational study for the Job Shop Scheduling Problem is presented. Thereby, emphasis is put on the structure of the search space as it appears for local search. A statistical analysis of the search space reveals the impact of inherent properties of the problem on local search based heuristics.

Reviews

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