Artificial intelligence search methods for multi-machine two-stage scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Artificial intelligence search methods for multi-machine two-stage scheduling

Full text

Pdf (606 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 31 - 35

Year of Publication: 1999

ISBN:1-58113-086-4

Author

In Lee

Department of Information Management and Decision Sciences, Western Illinois University, Macomb, IL

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

references index terms peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/298151.298174 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Campbell, H.G., R. A. Dudek, and M. L. Smith, "A Heuristic Algorithm of the n Job, m Machine Sequencing Problem," Management Science, Vo. 16, n In June, loTn n~n_nn~7
	2	Gary A. Cleveland , Stephen F. Smith, Using genetic algorithms to schedule flow shop releases, Proceedings of the third international conference on Genetic algorithms, p.160-169, December 1989, George Mason University, United States
	3	Dannenbring, D. G., "An Evaluation of FIowshop en,encino l-le.rinticn" Mnnnm~mont ?~',iont.o Vnl 23, No 11, 1977, pp. I i 74- l 182.
	4	Lawrence Davis, Job Shop Scheduling with Genetic Algorithms, Proceedings of the 1st International Conference on Genetic Algorithms, p.136-140, July 01, 1985
	5	Mauro Dell'Amico , Marco Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research, v.41 n.1-4, p.231-252, 1993
	6	Glover, F., "Tabu Search-Part !,' ORSA Journal on Computing, Vol. 1, No. 3, Summer 1989, pp. 190- 206.
	7	Glover, F., "Tabu Search-Part II, ORSA Journal on Computing, Vol. 2, No. I, Winter 1990, pp. 4-32.
	8	G!over, E., "Tahu Search Fundamenmla and I I_nL~," Working Paper, University of Colorado at Boulder, May 1994.
	9	David E. Goldberg , Robert Lingle, Jr., AllelesLociand the Traveling Salesman Problem, Proceedings of the 1st International Conference on Genetic Algorithms, p.154-159, July 01, 1985
	10	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	11	Gupta, J. N. D., 'A Functional Heuristic Algorithm for the Flow-Shop Scheduling Problem," Operations Research, 22(i ), 1971, pp. 39-48.
	12	John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
	13	Johnson, S. M., "Optimal Two and Three-Stage Production Schedules with Setup Times Included," Naval Research Logistics Quarterly, 1 (1), 1954, pp. 61-68.
	14	Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing," Science, Vol. 220, 1983, pp. 671-680.
	15	Lee, I., R. Sikora, and M. Shaw, "A Genetic Algorithm-Based Approach to Flexible Flow-Line Scheduling," IEEE Transactions on Systems, Man, and Cybernetics-Part B. Cybernetics, Vol. 27, No. 1, 1997, pp. 36-54.
	16	Miroslaw Malek , Mohan Guruswamy , Mihir Pandya, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Annals of Operations Research, v.21 n.1-4, p.59-84, Nov. 1989 [doi>10.1007/BF02022093]
	17	Hirofumi Matsuo , Chang Juck Suh , Rober S. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problem, Annals of Operations Research, v.21 n.1-4, p.85-108, Nov. 1989 [doi>10.1007/BF02022094]
	18	Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of State Calculations by Fast Computing Machines," Journal of Chemical Physics, 21, 1953, pp. 1087-1092.
	19	F. A. Ogbu , D. K. Smith, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers and Operations Research, v.17 n.3, p.243-253, 1990 [doi>10.1016/0305-0548(90)90001-N]
	20	I. M. Oliver , D. J. Smith , J. R. C. Holland, A study of permutation crossover operators on the traveling salesman problem, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, p.224-230, October 1987, Cambridge, Massachusetts, United States
	21	Osman, I. H. and C. N. Potts, "Simulated Annealing for Permutation Flow-Shop Scheduling," OMEGA, Vol. 17, No. 6, 1989, pp. 551-557.
	22	Palmer, D. S., "Sequencing Jobs through a Multistage Process in the Minimum Total Time - A Quick Method of Obtaining a Near Optimum," Operations Research Quarterly, 16, 1965, pp. 10 I- 107.
	23	Perttunen, J, 1994, On the significance of the initial solution in traveling salesman heuristics. Journal of the Operational Research Society, Vol. 45, October, 1131-1140.
	24	Riyaz T. Sikora , Michael J. Shaw, A multi-agent framework for coordination and system integration, 1994
	25	So, Kut C. and Scott, Carlton H., "Optimal Production Sequence for a Product with Matching Components," Operations Research, Vol. 42, July/Aug. 1994, pp. 694-708.
	26	Syswerda, G. and J. Palmucci, "The Application of Genetic Algorithms to Resource Scheduling," In Proceedings of the Fourth International Conference on Genetic Algorithms and Their Applications, San Diego, CA, 1991, pp. 502-508.
	27	Taillard, E. D., "Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem," European Journal of Operational Research, 47, 1990, pp. 65- 74.
	28	Taillard, E. D., "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem," ORSA Journal on Computing, Vol. 6, No. 2, Spring 1994, pp. 108-117.
	29	P. J. M. Laarhoven , E. H. L. Aarts, Simulated annealing: theory and applications, Kluwer Academic Publishers, Norwell, MA, 1987
	30	Darrell Whitley , Timothy Starkweather , D'Ann Fuquay, Scheduling problems and traveling salesman: the genetic edge recombination, Proceedings of the third international conference on Genetic algorithms, p.133-140, December 1989, George Mason University, United States
	31	Candace Arai Yano , Ram Rachamadugu, Sequencing to minimize work overload in assembly lines with product options, Management Science, v.37 n.5, p.572-586, May 1991 [doi>10.1287/mnsc.37.5.572]

INDEX TERMS

Primary Classification:
D. Software
D.4 OPERATING SYSTEMS

Additional Classification:
H. Information Systems
H.3 INFORMATION STORAGE AND RETRIEVAL
H.3.3 Information Search and Retrieval
Subjects: Search process

I. Computing Methodologies
I.2 ARTIFICIAL INTELLIGENCE

General Terms:
Design, Management, Theory

Keywords:
genetic algorithm, search methods, simulated annealing, tabu search

Peer to Peer - Readers of this Article have also read:

Constructing reality Proceedings of the 11th annual international conference on Systems documentation
Douglas A. Powell , Norman R. Ball , Mansel W. Griffiths
Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein

Adobe Acrobat

QuickTime

Windows Media Player

Real Player