This paper presents a special case of the general shop called stage shop problem. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective functi
✦ LIBER ✦
Sevast'yanov's algorithm for the flow-shop scheduling problem
✍ Scribed by Helena Ramalhinho Lourenço
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 825 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A GA/TS algorithm for the stage shop sch
✍
Mohammad Mahdi Nasiri; Farhad Kianfar
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 570 KB
Worst-case analysis of Dannenbring's alg
✍
Eugeniusz Nowicki; Czesław Smutnicki
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 420 KB
An efficient memetic algorithm for solvi
✍
Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 741 KB
## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff
An efficient genetic algorithm for hybri
✍
Orhan Engin; Gülşad Ceran; Mustafa K. Yilmaz
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 219 KB
Flexible job-shop scheduling problem by
✍
Kenichi Ida; Kensaku Oka
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 361 KB
An approximation algorithm for the m-mac
✍
Eugeniusz Nowicki
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 423 KB