Ronnachai SirovetnukulDuangpun Kritchanchai SingkarinThanakorn NaennaSem, Chantha, 1993-2026-02-062026-02-06202120262021Thesis (M.Eng. (Industrial Engineering))--Mahidol University, 2021https://repository.li.mahidol.ac.th/handle/123456789/114167The 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).xiii, 182 leaves : ill.application/pdfengผลงานนี้เป็นลิขสิทธิ์ของมหาวิทยาลัยมหิดล ขอสงวนไว้สำหรับเพื่อการศึกษาเท่านั้น ต้องอ้างอิงแหล่งที่มา ห้ามดัดแปลงเนื้อหา และห้ามนำไปใช้เพื่อการค้าProduction schedulingManufacturing processesMultiple criteria decision making.Master ThesisMahidol University