Local search methods for job shop scheduling

Graduate Project

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_projects/qn59qb994

Descriptions

Attribute Name	Values
Creator	Qi, Yenong
Abstract	Scheduling problem has both theoretical and practical interest. A great deal of research has been done in this field. In this paper we will use a local optimal search method to do job shop scheduling. This method will be compared with a constraint satisfaction method called Micro-boss. Other issues such as deadlock-free scheduling and the effect of job priority on scheduling are also studied in. this research. We present a local optimization algorithm called local-shifting to find locally optimal deadlock-free schedules. Our experimental results indicate that the local search method produces schedules almost as good as Micro-boss with tardiness cost criterion, and that iterative local optimization improves the quality of schedules.
Resource Type	Capstone Project
Date Issued	1993-10-07
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1993
Advisor	Minoura, Toshimi Tadepalli, Prasad
Committee Member	Saletore, Vikram A.
Academic Affiliation	Computer Science
Rights Statement	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Qi_Yenong_1993_10_07.pdf	2022-12-27	Public	Download