Abstract
The problem of unrelated parallel machines scheduling is very important in this industry. Scheduling is useful to save company resources, one of which is in terms of time. With minimization of completion time, companies can fulfill it quickly and precisely. Focuses on unrelated parallel machine scheduling problems that depend on sequences aimed at minimizing total turnaround time by considering setup time. This paper presents how unrelated parallel machine scheduling using the particle swarm optimization algorithm approach. The experimental results obtained indicate the optimum value.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
