Parallel CPU and GPU computations to solve the job shop scheduling problem with blocking

@inproceedings{AitZai2013ParallelCA,
  title={Parallel CPU and GPU computations to solve the job shop scheduling problem with blocking},
  author={Abdelhakim AitZai and Mourad Boudhar and Adel Dabah},
  year={2013}
}
In this paper, we studied the parallelization of an exact method to solve the job shop scheduling problem with blocking JSB. We used a modeling based on graph theory exploiting the alternative graphs. We have proposed an original parallelization technique for performing a parallel computation in the various branches of the search tree. This technique is implemented on computers network, where the number of computers is not limited. Its advantage is that it uses a new concept that is the logical… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

An algorithm for solving the job-shop problem

  • J. Carlier, E. Pinson
  • Management Science, Vol. 35, No. 2, pp.164–176
  • 1989
Highly Influential
4 Excerpts

Parallel branch-and-bound and parallel PSO for the job shop scheduling with blocking

  • A. AitZai, M. Boudhar
  • Int. J. Operational Research, vol. 16, No. 1
  • 2013
3 Excerpts

Similar Papers

Loading similar papers…