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 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
由: Sh Ahmad, Sh Salleh
出版: (2009) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm
由: Piroozfard, Hamed
出版: (2013) -
Bottleneck-based heuristic for three-machine flow shop scheduling
由: Abdul Rahim, Mohd Salleh
出版: (2011) -
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
由: Anuar, Nurul Izah
出版: (2022) -
Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems
由: Tan, Joe Yee
出版: (2022)