| Autor: |
Farashahi, Hamid Ghaani, Baharudin, B. T. H. T., Shojaeipour, Shahed, Jaberi, Mohammad |
| Zdroj: |
Intelligent Computing & Information Science (9783642181337); 2011, p385-392, 8p |
| Abstrakt: |
The aim of this paper is to minimise the makespan. The flexible job-shop scheduling is very common in practice and parallel machine is used in job-shop environment as flexibility. These flexibilities could be used for increasing the throughput rate, avoiding the production stop, removing bottleneck problems and finally achieving competitive advantages in economical environments. In opposition to classic job-shop where there is one machine in each stage, in this problem production system consists of multistage which in each stage there are one or several parallel machines with different speeds. The flexible job-shop scheduling with parallel machines problem consists of two sub-problems for solving: assigning and sequencing sub-problem. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
