New and 'stronger' job-shop neighbourhoods: a focus on the method of Nowicki and Smutnicki (1996)

Journal of Heuristics

Volumn 6, Issue 4, 2000, Pages 457-480

  Jain, Anant Singh ^a   Rangaswamy, Balasubramanian ^b   Meeran, Sheik ^c  

^a i2 Technologies   (United Kingdom)

^b US West Advanced Technologies   (United States)

^c UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; CONSTRAINT THEORY; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SCHEDULING;

CAPACITY CONSTRAINT; JOB SHOP SCHEDULING; NEIGHBORHOOD FUNCTION; NOWICKI METHOD; PRECEDENCE CONSTRAINT; SMUTNICKI METHOD;

HEURISTIC METHODS;

EID: 0034269642     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009617209268     Document Type: Article

References (29)

1. Baker, K.R. (1974). Introduction to Sequencing and Scheduling. New York: John Wiley.
2. Balas, E. and A. Vazacopoulos. (1998). "Guided Local Search with Shifting Bottleneck for Job-Shop Scheduling." Management Science 44(2), 262-275.
3. Blazewicz, J., W. Domschke, and E. Pesch. (1996). "The Job-Shop Scheduling Problem: Conventional and New Solution Techniques." European Journal of Operational Research 93(1), 1-33.
4. Chang, Y.L., T. Sueyoshi, and R.S. Sullivan. (1996). "Ranking Dispatching Rules by Data Envelopment Analysis in a Job-Shop Environment." HE Transactions 28(8), 631-642.
5. Dell'Amico, M. and M. Trubian. (1993). "Applying Tabu Search to the Job-Shop Scheduling Problem." Annals of Operations Research 41, 231-252.
6. Demirkol, E., S. Mehta, and R. Uzsoy. (1998)."Benchmarks for Shop Scheduling Problems." European Journal of Operational Research 109(1), 137-141.
7. Dongarra, J.J. (1998). "Performance of Various Computers Using Standard Linear Equations Software." Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301, Tennessee, USA.
8. Fisher, H. and G.L. Thompson. (1963). "Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules." In J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling. Englewood Cliffs, New Jersey: Prentice Hall, Ch. 15, pp. 225-251.
9. French, S. (1982). Sequencing and Scheduling - An Introduction to the Mathematics of the Job-Shop. New York: Ellis Horwood, John-Wiley & Sons.
10. Giffler, B. and G.L. Thompson. (1960). "Algorithms for Solving Production Scheduling Problems." Operations Research 8, 487-503.
11. Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.
12. Grabowski, J., E. Nowicki, and C. Smutnicki. (1988). "Block Algorithm for Scheduling Operations in a Job-Shop System." Przeglad Statystyczny XXXV, 1, 67-80, in Polish.
13. Jain, A.S. (1998). "A Multi-Level Hybrid Framework for the Deterministic Job-Shop Scheduling Problem." Ph.D. Thesis, Department of APEME, University of Dundee, Dundee, Scotland, UK, DD1 4HN.
14. Jain, A.S. and S. Meeran. (1999). "Deterministic Job-Shop Scheduling: Past, Present and Future." European Journal of Operational Research 113(2), 390-434.
15. Kolonko, M. (1999). "Some New Results on Simulated Annealing Applied to the Job Shop Scheduling Problem." European Journal of Operational Research 113(1), 123-136.
16. Lawrence, S. (1984). "Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques." GSIA, Carnegie-Mellon University, Pittsburgh.
17. Lehmann, E.L. (1975). Nonparametrics: Statistical Methods Based on Ranks. San Francisco: Holden-Day.
18. Lourenço, H.R.D. and M. Zwijnenburg. (1996). "Combining the Large-Step Optimization with Tabu-Search: Application to the Job-Shop Scheduling Problem." In I.H. Osman and J.P. Kelly (eds.), Meta-heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 219-236.
19. Matsuo, H., C.J. Suh, and R.S. Sullivan. (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, Austin, Texas, USA.
20. Mattfeld, D.C. (1996). Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling. Heidelberg, Germany: Physica-Verlag.
21. Nowicki, E. and C. Smutnicki. (1996). "A Fast Taboo Search Algorithm for the Job-Shop Problem." Management Science 42(6), 797-813.
22. Panwalkar, S.S. and W. Iskander. (1977). "A Survey of Scheduling Rules." Operations Research 25(1), 45-61.
23. Sabuncuoglu, I. and M. Bayiz. (1997). "A Beam Search Based Algorithm for the Job Shop Scheduling Problem." Research Report: IEOR-9705, Department of Industrial Engineering, Bilkent University, 06533 Ankara, Turkey.
24. Taillard, E. (1994). "Parallel Taboo Search Techniques for the Job-Shop Scheduling Problem." ORSA Journal on Computing 16(2), 108-117.
25. Thomsen, S. (1997). "Meta-heuristics Combined with Branch & Bound." Technical Report, Copenhagen Business School, Copenhagen, Denmark (in Danish).
26. Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra. (1996). "Job Shop Scheduling by Local Search." INFORMS Journal on Computing 8, 302-317.
27. Van Laarhoven, P.J.M., E.H.L. Aarts, and J.K. Lenstra. (1988). "Job Shop Scheduling by Simulated Annealing." Report OS-R8809, Centrum voor Wiskunde en Informatica, Amsterdam.
28. Van Laarhooven, P.J.M., E.H.L. Aarts, and J.K. Lenstra. (1992). "Job Shop Scheduling by Simulated Annealing." Operations Research 40(1), 113-125.
29. Werner, F. and A. Winkler. (1995). "Insertion Techniques for the Heuristic Solution of the Job-Shop Problem." Discrete Applied Mathematics 58(2), 191-211.