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...

全面介绍

Saved in:
书目详细资料
主要作者: Abdullah, Nurul Azma
格式: Thesis
语言:English
出版: 2004
主题:
在线阅读:http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍