-
1
-
-
0039809874
-
-
Working paper, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
-
Aarts, E.H.L., Van Laarhoven, P.J.M., Ulder, N.L.J., 1991. Local search based algorithms for job shop scheduling. Working paper, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
-
(1991)
Local Search Based Algorithms for Job Shop Scheduling
-
-
Aarts, E.H.L.1
Van Laarhoven, P.J.M.2
Ulder, N.L.J.3
-
2
-
-
0001255490
-
A computational study of local search algorithms for job shop scheduling
-
Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J., 1994. A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing 6 (2).
-
(1994)
ORSA Journal on Computing
, vol.6
, Issue.2
-
-
Aarts, E.H.L.1
Van Laarhoven, P.J.M.2
Lenstra, J.K.3
Ulder, N.L.J.4
-
3
-
-
0023977010
-
The shifting bottleneck procedure for job shop scheduling
-
Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science. 34:1988;391-401.
-
(1988)
Management Science
, vol.34
, pp. 391-401
-
-
Adams, J.1
Balas, E.2
Zawack, D.3
-
4
-
-
0041472810
-
A Computational Study of Job-Shop Scheduling
-
Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, 1990
-
Applegate, D., Cook, W., 1990. A Computational Study of Job-Shop Scheduling. Technical report CMU-CS-90-145, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, 1990.
-
(1990)
Technical Report CMU-CS-90-145
-
-
Applegate, D.1
Cook, W.2
-
6
-
-
0021496929
-
Sequencing rules and due-date assignments in job shop
-
Baker K.R. Sequencing rules and due-date assignments in job shop. Management Science. 30(9):1984;1093-1104.
-
(1984)
Management Science
, vol.30
, Issue.9
, pp. 1093-1104
-
-
Baker, K.R.1
-
7
-
-
0024765468
-
A bottleneck-based beam search for job scheduling in a flexible manufacturing system
-
Chang Y., Matsuo H., Sullivan R.S. A bottleneck-based beam search for job scheduling in a flexible manufacturing system. International Journal of Production Research. 27(11):1989;1949-1961.
-
(1989)
International Journal of Production Research
, vol.27
, Issue.11
, pp. 1949-1961
-
-
Chang, Y.1
Matsuo, H.2
Sullivan, R.S.3
-
8
-
-
0006463310
-
Flexible manufacturing system (FMS) scheduling using filtered beam search
-
De S., Lee A. Flexible manufacturing system (FMS) scheduling using filtered beam search. Journal of Intelligent Manufacturing. 1:1990;165-183.
-
(1990)
Journal of Intelligent Manufacturing
, vol.1
, pp. 165-183
-
-
De, S.1
Lee, A.2
-
10
-
-
0003603813
-
-
W.H. Freeman, San Francisco, California
-
Garey, M.R., Johnson, D.S., 1979. Computers abd Intertracability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, California.
-
(1979)
Computers Abd Intertracability: A Guide to the Theory of NP-Completeness
-
-
Garey, M.R.1
Johnson, D.S.2
-
11
-
-
0000411214
-
Tabu Search, Part-I
-
Glover F. Tabu Search, Part-I. ORSA Journal on Computing. 1(3):1989;190-206.
-
(1989)
ORSA Journal on Computing
, vol.1
, Issue.3
, pp. 190-206
-
-
Glover, F.1
-
12
-
-
0001724713
-
Tabu Search, Part II
-
Glover F. Tabu Search, Part II. ORSA Journal on Computing. 2(1):1990;4-32.
-
(1990)
ORSA Journal on Computing
, vol.2
, Issue.1
, pp. 4-32
-
-
Glover, F.1
-
14
-
-
85031589613
-
-
Department of Applied Physics and Electronic and Mechanical Engineering, University of Dundee, Dundee, UK
-
Jain, A.S., Meeran, S., 1996. The Job Shop Problem: Past, Present and Future. Department of Applied Physics and Electronic and Mechanical Engineering, University of Dundee, Dundee, UK.
-
(1996)
The Job Shop Problem: Past, Present and Future
-
-
Jain, A.S.1
Meeran, S.2
-
18
-
-
0000017036
-
Large-step Markov chains for traveling salesman problem
-
Martin O., Otto S.W., Felten E.W. Large-step Markov chains for traveling salesman problem. Complex Systems. 5:1989;299-326.
-
(1989)
Complex Systems
, vol.5
, pp. 299-326
-
-
Martin, O.1
Otto, S.W.2
Felten, E.W.3
-
19
-
-
0003657544
-
-
Working paper 03-04-88, Graduate School of Business, The University of Texas at Austin, Texas, USA
-
Matsua, H., Suh, C.J., Sullivan, R.S., 1988. A controlled search simulated annealing method for the general job shop scheduling problem. Working paper 03-04-88, Graduate School of Business, The University of Texas at Austin, Texas, USA.
-
(1988)
A Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem
-
-
Matsua, H.1
Suh, C.J.2
Sullivan, R.S.3
-
20
-
-
0003949709
-
-
Wiley, New York, 1993
-
Morton, T.E., Pentico, D.W., 1993. Heuristic Scheduling Systems. Wiley, New York, 1993.
-
(1993)
Heuristic Scheduling Systems
-
-
Morton, T.E.1
Pentico, D.W.2
-
21
-
-
0002899224
-
Conventional genetic algorithm for job shop problems
-
San Diego, California, USA
-
Nakano, R., Yamada, T., 1991. Conventional genetic algorithm for job shop problems. Proceedings of the Fourth International Conference on the Genetic Algorithms and Their Applications, San Diego, California, USA, pp. 474-479.
-
(1991)
Proceedings of the Fourth International Conference on the Genetic Algorithms and Their Applications
, pp. 474-479
-
-
Nakano, R.1
Yamada, T.2
-
24
-
-
0032000573
-
A beam search algorithm and evaluation of scheduling approaches for FMSs
-
Sabuncuoglu, I., Karabuk, S., 1998. A beam search algorithm and evaluation of scheduling approaches for FMSs. IIE Transactions 30 (2), 179-191.
-
(1998)
IIE Transactions
, vol.30
, Issue.2
, pp. 179-191
-
-
Sabuncuoglu, I.1
Karabuk, S.2
|