Experimental Analysis of a Neighborhood Generation Mechanism Applied to Scheduling Problem

This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slac...

Full description

Saved in:
Bibliographic Details
Main Authors: Cruz-Chavez, M.A., Frausto-Solis, J., Cora-Mora, J.R.
Format: Conference Proceeding
Language:English
Subjects:
Automotive engineering
Computer science
Genetic algorithms
Job shop scheduling
Processor scheduling
Robots
Simulated annealing
Testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack-time between the adjacent pair of operations that is permuted, then it is proven, through experimentation that the new neighbor (schedule) generated is feasible
DOI:10.1109/CERMA.2006.112