Job shop scheduling with beam search

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.118, Iss.2, 1999-10, pp. : 390-412

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 tabu search method guided by shifting bottleneck for the job shop scheduling problem

By Pezzella F. Merelli E.

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 297-310

Elsevier

Access to resources Recommend Favorite

Job-shop scheduling with processing alternatives

By Kis T.

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 307-332

Elsevier

Access to resources Recommend Favorite

Application of Hybrid Firefly Algorithm-Tabu Search Technique to Minimize the Makespan in Job Shop Scheduling problem

International Journal of Applied Industrial Engineering (IJAIE), Vol. 3, Iss. 2, 2016-07 ,pp. : 1-21

IGI Global_journal

Access to resources Recommend Favorite

Job-shop scheduling with blocking and no-wait constraints

By Mascis A. Pacciarelli D.

European Journal of Operational Research, Vol. 143, Iss. 3, 2002-12 ,pp. : 498-517

Elsevier

Access to resources Recommend Favorite

Analysis of reactive scheduling problems in a job shop environment

By Sabuncuoglu I. Bayiz M.

European Journal of Operational Research, Vol. 126, Iss. 3, 2000-11 ,pp. : 567-586

Elsevier

Access to resources Recommend Favorite