%0 Journal Article %T On Solving Constraint Satisfaction Based Job-Shop Scheduling Problems
基于约束满足的Job-Shop调度问题求解方法研究 %A CHEN En-hong %A XUE Han-hong %A
陈恩红 %A 薛瀚宏 %J 软件学报 %D 1998 %I %X In this paper, the authors discuss how to solve a set of typical constraint satisfaction problems, Job-Shop scheduling problems. Based upon the depth-first search, formal strategies of enforcing consistency, selecting operation and selecting start time are given, heuristic strategies of enforcing consistency and incomplete back jumping are introduced to further enhance the efficiency in solving Job-Shop scheduling problems. %K Enforcing consistency %K selecting operation %K selecting start time %K incomplete back jumping %K difficult operation set
一致性实施,操作选择,开始时间选择,不完全回跳,困难操作集. %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D17B59D20DBA8E8FAFF0C4973DB6ACAC&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=59906B3B2830C2C5&sid=7C8C2BAFC9BA0571&eid=29C36F017AD88B64&journal_id=1000-9825&journal_name=软件学报&referenced_num=6&reference_num=7