A locally optimal insertion heuristic for a one-machine scheduling problem

Frank Werner

RAIRO - Operations Research - Recherche Opérationnelle (1990)

  • Volume: 24, Issue: 3, page 255-262
  • ISSN: 0399-0559

How to cite

top

Werner, Frank. "A locally optimal insertion heuristic for a one-machine scheduling problem." RAIRO - Operations Research - Recherche Opérationnelle 24.3 (1990): 255-262. <http://eudml.org/doc/104985>.

@article{Werner1990,
author = {Werner, Frank},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {one-machine scheduling; release dates; heuristic},
language = {eng},
number = {3},
pages = {255-262},
publisher = {EDP-Sciences},
title = {A locally optimal insertion heuristic for a one-machine scheduling problem},
url = {http://eudml.org/doc/104985},
volume = {24},
year = {1990},
}

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
PB - EDP-Sciences
VL - 24
IS - 3
SP - 255
EP - 262
LA - eng
KW - one-machine scheduling; release dates; heuristic
UR - http://eudml.org/doc/104985
ER -

References

top
  1. 1. B. GOLDEN, L. BODIN, T. DOYLE and W. Jr. STEWART, Approximate Traveling Salesman Algorithms, Oper. Res., 1980, 28, pp. 694-711. Zbl0447.90081MR576317
  2. 2. S. K. GUPTA and J. KYPARISIS, Single Machine Scheduling Research, OMEGA 1987, 15, pp. 207-227. 
  3. 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. Zbl0377.90054MR462552
  4. 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. Zbl0333.68044MR503698
  5. 5. D. C. LLEWELLYN, C. TOVEY and M. TRICK, Local Optimization on Graphs, Discrete Appl. Math., 1989, 23, pp. 157-178. Zbl0675.90085MR996547
  6. 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. Zbl0164.20002
  7. 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. 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. Zbl0656.90048MR947453
  9. 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. Zbl0364.90104MR459617
  10. 10. V. S. TANAEV, V. S. GORDON and J. M. SHAFRANSKI, Theory of Scheduling: One-Processing Systems (Russian), Moscow, 1984. 
  11. 11. M. VLACH, One-Processor Scheduling with Non-Uniform Ready Times, M.O.S. Ser. Optimization, 1979, 10, pp. 93-96. Zbl0403.90038MR543113
  12. 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. Zbl0627.90050MR951099
  13. 13. F. WERNER, Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme, Dissertation B, TU Magdeburg, 1989. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.