Dual-objective job shop scheduling problem using genetic algorithm with local search
1
Issued Date
2021
Copyright Date
2021
Resource Type
Language
eng
File Type
application/pdf
No. of Pages/File Size
xiii, 182 leaves : ill.
Access Rights
open access
Rights
ผลงานนี้เป็นลิขสิทธิ์ของมหาวิทยาลัยมหิดล ขอสงวนไว้สำหรับเพื่อการศึกษาเท่านั้น ต้องอ้างอิงแหล่งที่มา ห้ามดัดแปลงเนื้อหา และห้ามนำไปใช้เพื่อการค้า
Rights Holder(s)
Mahidol University
Bibliographic Citation
Thesis (M.Eng. (Industrial Engineering))--Mahidol University, 2021
Suggested Citation
Sem, Chantha, 1993- Dual-objective job shop scheduling problem using genetic algorithm with local search. Thesis (M.Eng. (Industrial Engineering))--Mahidol University, 2021. Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/114167
Title
Dual-objective job shop scheduling problem using genetic algorithm with local search
Author(s)
Abstract
The Job Shop Scheduling Problem (JSSP) is work allocation on workstations to produce items that have a goal to optimize one or a few objectives. This research aimed to develop a JSSP's model that deals with machines and job sequences by dual objective functions under the new gainful constraints which are involved with the types of skilled workers according to the case study of a steel mill. The proposed methodology of this research is applied with the Memetic algorithm (Genetic algorithm and Local Search technique) and the Pareto optimization. The results generated from the proposed idea can help the manager to decide on the assignment of the right worker to operate the right machine with the right job to achieve the objective values (minimum makespan and maximum average utilization of workers).
Degree Name
Master of Engineering
Degree Level
Master's degree
Degree Department
Faculty of Engineering
Degree Discipline
Industrial Engineering
Degree Grantor(s)
Mahidol University