We present two results about heuristic solutions to the job shop scheduling problem (JSP). First, we show that the well-known analytical results on convergence of simulated annealing (SA) do not hold in the application to the JSP. We give a simple counterexample where the SA process converges agains
✦ LIBER ✦
Some new results in flow shop scheduling
✍ Scribed by H. Röck
- Publisher
- Springer
- Year
- 1984
- Tongue
- English
- Weight
- 871 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Some new results on simulated annealing
✍
M. Kolonko
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 256 KB
Implementation of grasp in flow shop sch
✍
G. Prabhaharan; B. Shahul Hamid Khan; L. Rakesh
📂
Article
📅
2005
🏛
Springer
🌐
English
⚖ 113 KB
Some results in chromatic scheduling
✍
D. de Werra
📂
Article
📅
1974
🏛
Springer
🌐
English
⚖ 438 KB
Cyclic scheduling in 3-machine robotic f
✍
Yves Crama; Joris Van de Klundert
📂
Article
📅
1999
🏛
Springer US
🌐
English
⚖ 152 KB
We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a fixed sequence of activities. This sequence
On non-permutation solutions to some two
✍
Vitaly A. Strusevich; Carin M. Zwaneveld
📂
Article
📅
1994
🏛
Springer
🌐
English
⚖ 664 KB
Flow-shop scheduling design in an FMS ma
✍
H.-H. Huang; F.L. Lewis; O.C. Pastravanu; A. Gürel
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 682 KB