Abstract
This paper studies a permutation flow shop scheduling problem with deteriorating jobs. Deteriorating jobs are the jobs which the processing time depends on the waiting time before process starts. A particle swarm optimization algorithm with and without a proposed local search is developed to determine a job sequence with minimization of the total tardiness criterion. Furthermore, a simulated annealing is proposed to solve the problem. We compare the performance of these algorithms to achieve an optimal or near optimal solution. It is concluded that the particle swarm optimization algorithm with local search gives promising solutions. The quality of solution obtained by particle swarm optimization algorithm with local search is superior to that of the simulated annealing algorithm, but the simulated annealing algorithm takes shorter time to find a schedule solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
