A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows
The research considers the flow shop scheduling problem under the Just-In-Time (JIT) philosophy. There are n jobs waiting to be processed through m operations of a flow shop production system. The objective is to determine the job schedule such that the total cost consisting of setup, earliness, a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Prince of Songkla University
2018-10-01
|
| Series: | Songklanakarin Journal of Science and Technology (SJST) |
| Subjects: | |
| Online Access: | https://rdo.psu.ac.th/sjstweb/journal/40-5/28.pdf |
| _version_ | 1811326268829859840 |
|---|---|
| author | Anot Chaimanee Wisut Supithak |
| author_facet | Anot Chaimanee Wisut Supithak |
| author_sort | Anot Chaimanee |
| collection | DOAJ |
| description | The research considers the flow shop scheduling problem under the Just-In-Time (JIT) philosophy. There are n jobs
waiting to be processed through m operations of a flow shop production system. The objective is to determine the job schedule
such that the total cost consisting of setup, earliness, and tardiness costs, is minimized. To represent the problem, the Integer
Linear Programming (ILP) mathematical model is created. A Memetic Algorithm (MA) is developed to determine the proper
solution. The evolutionary procedure, worked as the global search, is applied to seek for the good job sequences. In order to
conduct the local search, an optimal timing algorithm is developed and inserted in the procedure to determine the best schedule of
each job sequence. From the numerical experiment of 360 problems, the proposed MA can provide optimal solutions for 355
problems. It is obvious that the MA can provide the good solution in a reasonable amount of time. |
| first_indexed | 2024-04-13T14:47:06Z |
| format | Article |
| id | doaj.art-7d5c5e39df8441c68315b75ed6199805 |
| institution | Directory Open Access Journal |
| issn | 0125-3395 |
| language | English |
| last_indexed | 2024-04-13T14:47:06Z |
| publishDate | 2018-10-01 |
| publisher | Prince of Songkla University |
| record_format | Article |
| series | Songklanakarin Journal of Science and Technology (SJST) |
| spelling | doaj.art-7d5c5e39df8441c68315b75ed61998052022-12-22T02:42:43ZengPrince of Songkla UniversitySongklanakarin Journal of Science and Technology (SJST)0125-33952018-10-014051203121810.14456/sjst-psu.2018.148A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windowsAnot Chaimanee0Wisut Supithak1Department of Industrial Engineering, Faculty of Engineering, Kasetsart University, Chatuchak, Bangkok, 10900 ThailandDepartment of Industrial Engineering, Faculty of Engineering, Kasetsart University, Chatuchak, Bangkok, 10900 ThailandThe research considers the flow shop scheduling problem under the Just-In-Time (JIT) philosophy. There are n jobs waiting to be processed through m operations of a flow shop production system. The objective is to determine the job schedule such that the total cost consisting of setup, earliness, and tardiness costs, is minimized. To represent the problem, the Integer Linear Programming (ILP) mathematical model is created. A Memetic Algorithm (MA) is developed to determine the proper solution. The evolutionary procedure, worked as the global search, is applied to seek for the good job sequences. In order to conduct the local search, an optimal timing algorithm is developed and inserted in the procedure to determine the best schedule of each job sequence. From the numerical experiment of 360 problems, the proposed MA can provide optimal solutions for 355 problems. It is obvious that the MA can provide the good solution in a reasonable amount of time.https://rdo.psu.ac.th/sjstweb/journal/40-5/28.pdfflow shop schedulingearliness tardinessdue windowoptimal timing algorithmMemetic Algorithm |
| spellingShingle | Anot Chaimanee Wisut Supithak A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows Songklanakarin Journal of Science and Technology (SJST) flow shop scheduling earliness tardiness due window optimal timing algorithm Memetic Algorithm |
| title | A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| title_full | A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| title_fullStr | A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| title_full_unstemmed | A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| title_short | A memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| title_sort | memetic algorithm to minimize the total sum of earliness tardiness and sequence dependent setup costs for flow shop scheduling problems with job distinct due windows |
| topic | flow shop scheduling earliness tardiness due window optimal timing algorithm Memetic Algorithm |
| url | https://rdo.psu.ac.th/sjstweb/journal/40-5/28.pdf |
| work_keys_str_mv | AT anotchaimanee amemeticalgorithmtominimizethetotalsumofearlinesstardinessandsequencedependentsetupcostsforflowshopschedulingproblemswithjobdistinctduewindows AT wisutsupithak amemeticalgorithmtominimizethetotalsumofearlinesstardinessandsequencedependentsetupcostsforflowshopschedulingproblemswithjobdistinctduewindows AT anotchaimanee memeticalgorithmtominimizethetotalsumofearlinesstardinessandsequencedependentsetupcostsforflowshopschedulingproblemswithjobdistinctduewindows AT wisutsupithak memeticalgorithmtominimizethetotalsumofearlinesstardinessandsequencedependentsetupcostsforflowshopschedulingproblemswithjobdistinctduewindows |