Simulated Hardening Algorithm Application in Advanced Planning and Scheduling
Simulated Hardening Algorithm Application in Advanced Planning and Scheduling

Summary/Abstract: This paper covers the problem of job scheduling for two-machine flow-shop system with unlimited transportation capability. The scope of the research complies with functionality of the decision support system (DSS) as a part of advanced planning and scheduling (APS). The 5 sets of random 500 jobs are introduced as the input sample. The simulated annealing (SA) algorithm with two variants of probability functions is used for delivering reference results. A new simulated hardening (SH) algorithm derived from SA is introduced and examined. Two optimization criteria are taken into consideration: makespan and profit. The results obtained with the two algorithms are compared and their usefulness in the problem presented is estimated.

• Details
• Contents