𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Applying simulated annealing to the open shop scheduling problem

✍ Scribed by CHING-FANG Liaw

Book ID
110250852
Publisher
Taylor and Francis Group
Year
1999
Tongue
English
Weight
143 KB
Volume
31
Category
Article
ISSN
0740-817X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some new results on simulated annealing
Some new results on simulated annealing applied to the job shop scheduling problem
✍ M. Kolonko πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 256 KB

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

Solving the open shop scheduling problem
Solving the open shop scheduling problem
✍ Ulrich Dorndorf; Erwin Pesch; ToΓ n Phan-Huy πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an