File Exchange

image thumbnail

Parallel Machine Scheduling using Simulated Annealing (SA)

version (9.78 KB) by Yarpiz
A structured MATLAB implementation of Simulated Annealing (SA) for Parallel Machine Scheduling


Updated 20 Sep 2015

View License

For more information, check the following link:

Cite As

Yarpiz (2020). Parallel Machine Scheduling using Simulated Annealing (SA) (, MATLAB Central File Exchange. Retrieved .

Comments and Ratings (7)

yu haibo

Shruba Gangopadhyay

Tabita Anindita

Thank you Sir, this is truly helpful

Maryam Montazer

Thanks a lot. I wish the best for the writer

S N Patil

Thank You Sir.
Your clarification helped me a lot in understanding the programs.


The number of machines in the problem is 4 and the number of jobs (processes) is 20. The matrix p contains the processing time of jobs on machines. The matrix s contains the setup time between any two jobs on every machine.

Because of the assignment and order of jobs, the number of variables (for the solution coding scheme used in this implementation) equals to:

Number of Machines + Number of Jobs - 1

So for 20 jobs and 4 machines, the solution length, is given by: 20 + 4 - 1, which is as you mentioned: 23.

S N Patil

I found it very helpful to understand parallel machine scheduling. However lack of documentation made it difficult for me to understand it in a better way.
May I know what is
p=[20X4] and s(20,20,4)
and total machines are 20 but model.nVar is assigned to 23. Why?

MATLAB Release Compatibility
Created with R2009b
Compatible with any release
Platform Compatibility
Windows macOS Linux

Inspired: Flowshop Scheduling(basic)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!