A locally optimal insertion heuristic for a one-machine scheduling problem
RAIRO - Operations Research - Recherche Opérationnelle, Volume 24 (1990) no. 3, pp. 255-262.
@article{RO_1990__24_3_255_0,
     author = {Werner, Frank},
     title = {A locally optimal insertion heuristic for a one-machine scheduling problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {255--262},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {3},
     year = {1990},
     mrnumber = {1075797},
     zbl = {0716.90054},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1990__24_3_255_0/}
}
TY  - JOUR
AU  - Werner, Frank
TI  - A locally optimal insertion heuristic for a one-machine scheduling problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1990
SP  - 255
EP  - 262
VL  - 24
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1990__24_3_255_0/
LA  - en
ID  - RO_1990__24_3_255_0
ER  - 
%0 Journal Article
%A Werner, Frank
%T A locally optimal insertion heuristic for a one-machine scheduling problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1990
%P 255-262
%V 24
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1990__24_3_255_0/
%G en
%F RO_1990__24_3_255_0
Werner, Frank. A locally optimal insertion heuristic for a one-machine scheduling problem. RAIRO - Operations Research - Recherche Opérationnelle, Volume 24 (1990) no. 3, pp. 255-262. http://archive.numdam.org/item/RO_1990__24_3_255_0/

1. B. Golden, L. Bodin, T. Doyle and W. Jr. Stewart, Approximate Traveling Salesman Algorithms, Oper. Res., 1980, 28, pp. 694-711. | MR | Zbl

2. S. K. Gupta and J. Kyparisis, Single Machine Scheduling Research, OMEGA 1987, 15, pp. 207-227.

3. H. Kise, T. Ibaraki, and H. Mine, A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times, Oper. Res., 1978, 26, pp. 121-126. | MR | Zbl

4. E. L. Lawler, Sequencing to Minimize the Weighted Number of Tardy Jobs, R.A.I.R.O. Rech. Oper. 1976, 10, pp. 27-33. | MR | Zbl

5.D. C. Llewellyn, C. Tovey and M. Trick, Local Optimization on Graphs, Discrete Appl. Math., 1989, 23, pp. 157-178. | MR | Zbl

6. J. M. Moore, An n Job, one Machine Sequencing Algorithm for Minimizing the Number of Late Jobs, Manage. Sci., 1968, 75, pp. 102-109. | Zbl

7. M. Nawaz, E. E. Enscore and I. Ham, A Heuristic Algorithm for the m-Machine, n-Machine Flow-Shop Sequencing Problem, OMEGA, 1983, 11, pp. 91-95.

8. C. N. Potts and L. N. Wassenhove, Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs, Manage. Sci., 1988, 34, pp. 843-858. | MR | Zbl

9. D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis, An Analysis of Several Heuristics for the Traveling Salesman Problem, SIAM J. Comput., 1977, 6, pp. 563-581. | MR | Zbl

10. V. S. Tanaev, V. S. Gordon and J. M. Shafranski, Theory of Scheduling: One-Processing Systems (Russian), Moscow, 1984.

11. M. Vlach, One-Processor Scheduling with Non-Uniform Ready Times, M.O.S. Ser. Optimization, 1979, 10, pp. 93-96. | MR | Zbl

12. F. Werner, Zu einigen Nachbarschaftsgraphen für die Entwicklung geeigneter Iterationsverfahren zur näherungsweisen Lösung eines speziellen Permutations problems, Wiss. Zeitschrift TU Magdeburg, 1987, H. 4, 31, pp. 48-54. | MR | Zbl

13. F. Werner, Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme, Dissertation B, TU Magdeburg, 1989.