Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.107, Iss.1-4, 2001-10, pp. : 65-81

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

Job shop scheduling with separable sequence-dependent setups

By Choi I-C. Korkmaz O.

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 155-170

Springer Publishing Company

Access to resources Recommend Favorite

Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

By Artigues Christian

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 21-52

Springer Publishing Company

Access to resources Recommend Favorite

An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times

By Artigues C. Roubellat O.

Production Planning and Control, Vol. 13, Iss. 2, 2002-03 ,pp. : 175-186

Taylor & Francis Ltd

Access to resources Recommend Favorite

Comparative evaluation of genetic algorithms for job-shop scheduling

By Ponnambalam S. G. Aravindan P. Rao P.S.

Production Planning and Control, Vol. 12, Iss. 6, 2001-09 ,pp. : 560-574

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving the no-wait flow-shop problem with sequence-dependent set-up times

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 3, 2014-03 ,pp. : 213-228

Taylor & Francis Ltd

Access to resources Recommend Favorite