A modified simulated annealing method for flexible job shop scheduling problem

The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan...

Full description

Saved in:
Bibliographic Details
Main Authors: Najid, N.M., Dauzere-Peres, S., Zaidat, A.
Format: Conference Proceeding
Language:English
Subjects:
Job shop scheduling
Polynomials
Routing
Search methods
Simulated annealing
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem considered in this paper is an important extension of the classical job shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs Is minimized. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.2002.1176334