In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Sequence Setup Times, Due Dates Maintenance Times is presented. article after introduction literature review mathematical model of Machines After that Monte Carlo Tree Search Simulated Annealing are detailed. Our representation technique its evaluation also introduced. th...

This paper discusses future directions in tools and techniques for programming parallel supercomputers We base the discussion on two important observations Automatic parallelization of sequential programs will not achieve supercomputer performance in re al applications Instead applications will have to be written with explicit parallelism Machine independence of parallel programs is a precondit...

AIMGP is a very fast linear genetic programming approach that evolves machine code programs. We report on a parallelization of AIMGP for a parallel transputer system resulting in an almost linear speedup. In linear genetic programming (GP) computer programs of imperative programmming languages like C or machine code are evolved (Banzhaf et al. 1998). AIMGP (Automatic Induction of Machine code b...

POM is a Parallel Observable Machine featuring mechanisms for building and observing distributed applications. It comes in the form of a library built upon the many communication kernels available on current parallel architectures and a loader that provides the user with a homogeneous syntax for launching parallel applications on any parallel platform. The prior goal of POM is not to o er numer...