On the power of randomization for job shop scheduling with k-units length tasks

E-ISSN： 1290-385x|43|2|189-207

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.2, 2008-06, pp. : 189-207

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 unit length tasks

By Akveld Meike Bernhard Raphael

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 3, 2012-08 ,pp. : 329-342

Edp Sciences

Access to resources Recommend Favorite

Ant colony optimisation for scheduling of flexible job shop with multi-resources requirements

MATEC Web of conference, Vol. 112, Iss. issue, 2017-07 ,pp. : 06018-06018

Edp Sciences

Access to resources Recommend Favorite

Flexible job-shop scheduling based on genetic algorithm and simulation validation

MATEC Web of conference, Vol. 100, Iss. issue, 2017-03 ,pp. : 02047-02047

Edp Sciences

Access to resources Recommend Favorite

Genetic Algorithm Combined with Gradient Information for Flexible Job-shop Scheduling Problem with Different Varieties and Small Batches

MATEC Web of conference, Vol. 95, Iss. issue, 2017-02 ,pp. : 10001-10001

Edp Sciences

Access to resources Recommend Favorite

Ant Foraging Behavior for Job Shop Problem

By Mahad Diyana Abdul

MATEC Web of conference, Vol. 52, Iss. issue, 2016-04 ,pp. : 01005-01005

Edp Sciences

Access to resources Recommend Favorite