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

Author： AitZai Abdelhakim   Boudhar Mourad  

Publisher： Inderscience Publishers

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.16, Iss.1, 2013-11, pp. : 14-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A self-tuning PSO for job-shop scheduling problems

By Pongchairerks Pisut  

International Journal of Operational Research, Vol. 19, Iss. 1, 2014-11 ,pp. : 96-113

Inderscience Publishers

Access to resources Recommend Favorite

A branch-and-bound algorithm for the supply connected location-allocation problem on networks

By Yesilkokcen G.N.   Wesolowsky G.O.  

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 395-415

Elsevier

Access to resources Recommend Favorite

A shifting bottleneck approach for a parallel-machine flowshop scheduling problem

By Cheng J.   Karuno Y.   Kise H.  

Journal of the Operations Research Society of Japan, Vol. 44, Iss. 2, 2001-06 ,pp. : 140-156

Elsevier

Access to resources Recommend Favorite

A scheduling problem with unrelated parallel machines and sequence dependent setups

By Ravetti M. Gomez   Mateus Geraldo R.   Rocha Pedro L.   Pardalos Panos M.  

International Journal of Operational Research, Vol. 2, Iss. 4, 2007-06 ,pp. : 380-399

Inderscience Publishers

Access to resources Recommend Favorite

Agility in two-stage hybrid flow shop parallel machine scheduling through simulated annealing

By Arumugam C.   Raja K.   Selladurai V.  

International Journal of Services and Operations Management, Vol. 3, Iss. 3, 2007-04 ,pp. : 332-354

Inderscience Publishers

Access to resources Recommend Favorite