Publication not explained

This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.

If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.

Featured Image

Read the Original

This page is a summary of: Application of the Simulated Annealing Algorithm to Minimize the makespan on the Unrelated Parallel Machine Scheduling Problem with Setup Times, March 2019, Springer Science + Business Media,
DOI: 10.1007/978-3-030-14347-3_39.
You can read the full text:



The following have contributed to this page