Embedding temporal constraint propagation in machine sequencing for job shop scheduling1

Publisher： Cambridge University Press

E-ISSN： 1469-1760|7|1|37-52

ISSN： 0890-0604

Source： AI EDAM, Vol.7, Iss.1, 1993-02, pp. : 37-52

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 metaheuristic technique for energy-efficiency in job-shop scheduling

By  

Knowledge Engineering Review, Vol. 31, Iss. 5, 2017-01 ,pp. : 475-485

Cambridge University Press

Access to resources Recommend Favorite

An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

By Lu Kong   Ting Li   Keming Wang   Hanbing Zhu   Makoto Takano   Bin Yu  

Algorithms, Vol. 8, Iss. 1, 2015-02 ,pp. : 19-31

MDPI

Access to resources Recommend Favorite

Causality in constraint propagation

By  

AI EDAM, Vol. 11, Iss. 5, 1997-11 ,pp. : 419-433

Cambridge University Press

Access to resources Recommend Favorite

Extending the constraint propagation of intervals

By  

AI EDAM, Vol. 4, Iss. 1, 1990-02 ,pp. : 47-54

Cambridge University Press

Access to resources Recommend Favorite

Introduction to the special issue on constraint satisfaction for planning and scheduling

By  

Knowledge Engineering Review, Vol. 31, Iss. 5, 2017-02 ,pp. : 415-416

Cambridge University Press

Access to resources Recommend Favorite