A tabu search method guided by shifting bottleneck for the job shop scheduling problem

Publisher： Elsevier

ISSN： 0377-2217

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

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 approach for the flow shop scheduling problem

By Ben-Daya M. Al-Fawzan M.

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 88-95

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

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G. Strusevich V.A.

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite

Job shop scheduling with beam search

By Sabuncuoglu I. Bayiz M.

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

Elsevier

Access to resources Recommend Favorite

A fast tabu search algorithm for the permutation flow-shop problem

By Nowicki E. Smutnicki C.

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 160-175

Elsevier

Access to resources Recommend Favorite