Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim
β¦ LIBER β¦
A difficulty in the search for Giffen behavior
β Scribed by Christian E. Weber
- Book ID
- 105530388
- Publisher
- Springer US
- Year
- 1997
- Tongue
- English
- Weight
- 421 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0197-4254
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Problem difficulty for tabu search in jo
β
Jean-Paul Watson; J.Christopher Beck; Adele E. Howe; L.Darrell Whitley
π
Article
π
2003
π
Elsevier Science
π
English
β 402 KB
The difficulty in timing for liver trans
β
Didier Samuel; Jean-Charles Duclos-Vallee
π
Article
π
2006
π
John Wiley and Sons
π
English
β 64 KB
π 1 views
The Search for Employment: Motivation to
β
Barbara A. Caska
π
Article
π
1998
π
John Wiley and Sons
π
English
β 976 KB
What Can Searching Behavior Tell Us Abou
β
Jacek Gwizdka; Ian Spence
π
Article
π
2007
π
Wiley (John Wiley & Sons)
π
English
β 108 KB
## Abstract Task has been recognized as an influential factor in information seeking behavior. An increasing number of studies are concentrating on the specific characteristics of the task as independent variables to explain associated informationβseeking activities. This paper examines the relatio
A stochastic policy search model for mat
β
ZhenBo Cheng; Yu Zhang; ZhiDong Deng
π
Article
π
2011
π
Science in China Press (SCP)
π
English
β 869 KB
Difficulty in extubation : A cause for c
β
J. G. BROCK-UTNE; R. A. JAFFE; B. ROBINS; E. RATNER
π
Article
π
1992
π
John Wiley and Sons
π
English
β 136 KB