Job shop scheduling problem (JSSP)

The job shop scheduling problem is a special case of the general shop in which each job i consists of n tasks Tij with processing times pij (j=l, ... ,m) where Tij has to be processed on machine Mij, and the tasks have to be scheduled in predetermined given order. The job shop problem is to...

Full description

Saved in:
Bibliographic Details
Main Author: Abdullah, Nurul Azma
Format: Thesis
Language:English
Published: 2004
Subjects:
Online Access:http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items