Decomposition of timed automata for solving scheduling problems

ISSN： 1464-5319

Source： International Journal of Systems Science, Vol.45, Iss.3, 2014-03, pp. : 472-486

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

Solving resource-constrained construction scheduling problems with overlaps by metaheuristic

Journal of Civil Engineering and Management, Vol. 20, Iss. 5, 2014-09 ,pp. : 649-659

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic

By Ying Kuo-Ching

The International Journal of Advanced Manufacturing Technology, Vol. 38, Iss. 3-4, 2008-08 ,pp. : 348-354

Springer Publishing Company

Access to resources Recommend Favorite

Solving flow shop scheduling problems by quantum differential evolutionary algorithm

By Zheng Tianmin Yamashiro Mitsuo

The International Journal of Advanced Manufacturing Technology, Vol. 49, Iss. 5-8, 2010-07 ,pp. : 643-662

Springer Publishing Company

Access to resources Recommend Favorite

Solving job shop scheduling problems using artificial immune system

By Chandrasekaran M. Asokan P. Kumanan S. Balamurugan T. Nickolas S.

The International Journal of Advanced Manufacturing Technology, Vol. 31, Iss. 5-6, 2006-12 ,pp. : 580-593

Springer Publishing Company

Access to resources Recommend Favorite

A simulation-based learning automata framework for solving semi-Markov decision problems under long-run average reward

By ABHIJIT GOSAVI

IIE Transactions, Vol. 36, Iss. 6, 2004-06 ,pp. : 557-567

Taylor & Francis Ltd

Access to resources Recommend Favorite