We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.
✦ LIBER ✦
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
✍ Scribed by Kerem Bülbül
- Book ID
- 108106997
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 573 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A shifting bottleneck heuristic for mini
✍
Michael Pinedo; Marcos Singer
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 165 KB
👁 2 views
A modified shifting bottleneck heuristic
✍
Scott J. Mason; John W. Fowler; W. Matthew Carlyle
📂
Article
📅
2002
🏛
Springer US
🌐
English
⚖ 138 KB
Increases in the demand for integrated circuits have highlighted the importance of meeting customer quality and on-time delivery expectations in the semiconductor industry. A modiÿed shifting bottleneck heuristic is developed for minimizing the total weighted tardiness in a semiconductor wafer fabri
A genetic local search algorithm for min
✍
Imen Essafi; Yazid Mati; Stéphane Dauzère-Pérès
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 234 KB
A modified shifting bottleneck heuristic
✍
Seyda Topaloglu; Gamze Kilincli
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 281 KB
A hybrid tabu search algorithm with an e
✍
Jun-Qing Li; Quan-Ke Pan; P. N. Suganthan; T. J. Chua
📂
Article
📅
2010
🏛
Springer
🌐
English
⚖ 747 KB
A hybridization of simulated annealing a
✍
R. Tavakkoli-Moghaddam; M. Khalili; B. Naderi
📂
Article
📅
2008
🏛
Springer
🌐
English
⚖ 637 KB