A Mathematical model for flexible job shop scheduling problem with sequence-dependent setup time

Name: Teerapong Makong

Organization : Chiang Mai University. Faculty of Engineering

Email : teerapong.lg@gmail.com

Name: Warisa Wisittipanich

Organization : Chiang Mai University. Faculty of Engineering

keyword: Flexible job shop scheduling problem

ThaSH: Production scheduling

ThaSH: Mathematical models

Abstract: The flexible job shop scheduling problem (FJSP) is one of challenge scheduling problems that extends from the classical job shop scheduling problem (JSP). In FJSP, each operation can be processed by any machine from a set of available machines. Therefore, FJSP consists of several possible routing sub-problems and this makes the assignment of machine more complex than the classical JSP. Many researchers in the recent years have been studied the FJSP with interests in more realistic constraints. However, the constraints related to the direct usage of machines are not explicitly considered. Generally, In FJSP, setup time are included in the processing time, and not considered in the model. This paper presents a mathematical model as a mixed-integer programming model (MIP) of FJSP with the consideration of sequence-dependent setup time which makes the problem closer to the real practice in industry. The exact algorithm is developed and tested on instances from existing literature. The computational results show that the exact algorithm can only solve the small-size problems to optimal within an acceptable time

King Mongkut's University of Technology North Bangkok. Central Library

Address: BANGKOK

Email: library@kmutnb.ac.th

Modified: 2565-12-06

Issued: 2022-12-06

บทความ/Article

application/pdf

BibliograpyCitation : ใน มหาวิทยาลัยเชียงใหม่ คณะวิศวกรรมศาสตร์. การประชุมวิชาการข่ายงานวิศวกรรมอุตสาหการ ประจำปี พ.ศ. 2560 (IE Network 2017) (pp.1046-1050). เชียงใหม่ : มหาวิทยาลัยเชียงใหม่

eng

©copyrights King Mongkut's University of Technology North Bangkok

ลำดับที่.	ชื่อแฟ้มข้อมูล	ขนาดแฟ้มข้อมูล	จำนวนเข้าถึง	วัน-เวลาเข้าถึงล่าสุด
1	IE Network 2017pp.1046-1050.pdf	373.61 KB

ใช้เวลา

0.017203 วินาที