|
|
 | |  |
Volume 48, Number 5/6, 2004
IBM Research in Asia |
|
Table of contents:
 HTML PDF | |
This article:
HTML PDF | Copyright info |
| | | |
| | |
Finishing Line Scheduling in the steel industry - References
|
|
by
H. Okano, A. J. Davenport, M. Trumbo, C. Reddy, K. Yoda, and M. Amano
|
| |
|
References
-
H. Yasuda, H. Tokuyama, K. Tarui, Y. Tanimoto, and M. Nagano, “Two-Stage Algorithm for Production Scheduling of Hot Strip Mill,” Oper. Res. 32, 695–707 (1984).
-
H.-L. Fang and C.-H. Tsai, “A Genetic Algorithm Approach to Hot Strip Mill Rolling Scheduling Problems,” Proceedings of the International Conference on Tools with Artificial Intelligence, IEEE, Piscataway, NJ, 1998, pp. 264–271.
-
L. Lopez, M. W. Carter, and M. Gendreau, “The Hot Strip Mill Production Scheduling Problem: A Tabu Search Approach,” Eur. J. Oper. Res. 106, 317–335 (1998).
-
M. Numao and S. Morishita, “Co-operative Scheduling and Its Application to Steelmaking Industries,” IEEE Trans. Indust. Electron. 38, 150–155 (1991).
-
H.-S. Lee, S. S. Murthy, S. W. Haider, and D. V. Morse, “Primary Production Scheduling at Steelmaking Industries,” IBM J. Res. & Dev. 40, 231–252 (1996).
-
S. N. Talukdar, L. Baerentzen, A. Gove, and P. S. de Souza, “Asynchronous Teams: Cooperation Schemes for Autonomous Agents,” J. Heuristics 4, 295–321 (1998).
-
S. N. Talukdar, P. S. de Souza, and S. Murthy, “Organizations for Computer-Based Agents,” Int. J. Eng. Intell. Syst. 1, 75–87 (1993).
-
H. Gao, J. Zeng, and G. Sun, “Multi-Agent Approach for Planning and Scheduling of Integrated Steel Processes,” Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2002, pp. 427–432.
-
L. M. Wein and P. B. Chevalier, “A Broader View of the Job-Shop Scheduling Problem,” Manage. Sci. 38, 1018–1033 (1992).
-
R. C. Leachman, J. Kang, and V. Lin, “Slim: Short Cycle Time and Low Inventory in Manufacturing at SamsungElectronics,” Interfaces 32, 61–77 (2002).
-
J. L. Bentley, “Fast Algorithms for Geometric Traveling Salesman Problems,” ORSA J. Computing 4, 387–411 (1992).
-
D. S. Johnson and L. A. McGeoch, “The Traveling Salesman Problem: A Case Study,” Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds., John Wiley and Sons, Inc., New York, 1997, pp. 215–310.
-
H. Okano, T. Morioka, and K. Yoda, “A Heuristic Solution for the Continuous Galvanizing Line Scheduling Problem in a Steel Mill,” Research Report RT-0478, 2002; IBM Tokyo Research Laboratory, 1623-14 Shimo-tsuruma, Yamato-shi, Kanagawa-ken 242-8502, Japan.
-
J. L. Bentley, “K-d Trees for Semidynamic Point Sets,” Proceedings of the Sixth Annual ACM Symposium on Computational Geometry, 1990, pp. 187–197.
-
G. A. P. Kindervater and M. W. Savelsbergh, “Vehicle Routing: Handling Edge Exchanges,” Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds., John Wiley and Sons, Inc., New York, 1997, pp. 337–360.
|
|
|
|
|
