An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

Article Abstract:

The Enhanced Exchange Heuristic Algorithm (EEHA) can be used to effectively solve the generalized job shop scheduling problem with due dates, with the objective of minimizing total job tardiness. EEHA uses an insertion technique to integrate simulated annealing and the exchange heuristic algorithm. It reduces total tardiness in relation to initial schedules for relatively large-sized problems.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Simulated annealing for the unconstrained quadratic pseudo-Boolean function

Article Abstract:

A simulated annealing-based algorithm was proposed to address a quadratic pseudo-Boolean problem. Computational findings from several test problems showed the algorithm's ability in generating high-quality solution. The algorithm, which can also be utilized in more complex problems, entails a computational time that is much faster than other widely known methods.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Assignment of program modules to processors: a simulated annealing approach

Article Abstract:

Issues relating to simulated annealing algorithm methods are examined in detail, as ways of tackling program module assignment problems.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: