An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

Author： Dauzère-Pérès S.   Paulli J.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.70, Iss.1, 1997-01, pp. : 281-306

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

Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach

By      

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 8, 2014-08 ,pp. : 733-746

Taylor & Francis Ltd

Access to resources Recommend Favorite

Prototyped genetic search: a cybernetical approach to job-shop scheduling problems

By Khoukhi Amar  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 1, 2002-02 ,pp. : 96-114

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

An Advanced Tabu Search Algorithm for the Job Shop Problem

By Nowicki Eugeniusz   Smutnicki Czesław  

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 145-159

Springer Publishing Company

Access to resources Recommend Favorite

Multi-processor distributed simulation for job-shop scheduling: boon or bane?

By Koh Kwang-Hang   Souza Robert De   Ho Nai-Choon  

International Journal of Computer Integrated Manufacturing, Vol. 9, Iss. 6, 1996-11 ,pp. : 434-442

Taylor & Francis Ltd

Access to resources Recommend Favorite

A search space analysis of the Job Shop Scheduling Problem

By Mattfeld D.C.   Bierwirth C.   Kopfer H.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 441-453

Springer Publishing Company

Access to resources Recommend Favorite