Free Access
RAIRO-Oper. Res.
Volume 24, Number 3, 1990
Page(s) 255 - 262
Published online 06 February 2017
  • 1. B. GOLDEN, L. BODIN, T. DOYLE and W. Jr. STEWART, Approximate Traveling Salesman Algorithms, Oper. Res., 1980, 28, pp. 694-711. [MR: 576317] [Zbl: 0447.90081] [Google Scholar]
  • 2. S. K. GUPTA and J. KYPARISIS, Single Machine Scheduling Research, OMEGA 1987, 15, pp. 207-227. [Google Scholar]
  • 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: 462552] [Zbl: 0377.90054] [Google Scholar]
  • 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: 503698] [Zbl: 0333.68044] [Google Scholar]
  • 5.D. C. LLEWELLYN, C. TOVEY and M. TRICK, Local Optimization on Graphs, Discrete Appl. Math., 1989, 23, pp. 157-178. [MR: 996547] [Zbl: 0675.90085] [Google Scholar]
  • 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: 0164.20002] [Google Scholar]
  • 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. [Google Scholar]
  • 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: 947453] [Zbl: 0656.90048] [Google Scholar]
  • 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: 459617] [Zbl: 0364.90104] [Google Scholar]
  • 10. V. S. TANAEV, V. S. GORDON and J. M. SHAFRANSKI, Theory of Scheduling: One-Processing Systems (Russian), Moscow, 1984. [Google Scholar]
  • 11. M. VLACH, One-Processor Scheduling with Non-Uniform Ready Times, M.O.S. Ser. Optimization, 1979, 10, pp. 93-96. [MR: 543113] [Zbl: 0403.90038] [Google Scholar]
  • 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: 951099] [Zbl: 0627.90050] [Google Scholar]
  • 13. F. WERNER, Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme, Dissertation B, TU Magdeburg, 1989. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.