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 |