期刊文献+

Concurrent processes scheduling with scarce resources in small and medium enterprises

Concurrent processes scheduling with scarce resources in small and medium enterprises
下载PDF
导出
摘要 Scarce resources,precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises(SMEs),which are deemed to block the application of workflow management system(WfMS). To tackle this problem,a workflow scheduling approach is proposed based on timing workflow net(TWF-net) and genetic algorithm(GA). The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking. After simplifying and reconstructing the set of workflow instance,the conflict resolution problem is transformed into a resource-constrained project scheduling problem(RCPSP),which could be efficiently solved by a heuristic method,such as GA. Finally,problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-firstserved(FCFS) strategy. The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource constraints. Scarce resources, precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises (SMEs), which are deemed to block the ap- plication of workflow management system (WfMS). To tackle this problem, a workflow scheduling approach is proposed based on timing workflow net (TWF-net) and genetic algorithm (GA). The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking. After simplifying and reconstructing the set of workflow instance, the conflict resolution problem is transformed into a resource-constrained project scheduling problem (RCPSP), which could be efficiently solved by a heuristic method, such as GA. Finally, problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-first- served (FCFS) strategy. The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource con- straints.
出处 《High Technology Letters》 EI CAS 2016年第3期273-281,共9页 高技术通讯(英文版)
基金 Supported by the Postdoctoral Science Foundation of China(No.2015M572022) the National Natural Science Foundation of China(No.51175304)
关键词 concurrent processes scheduling resource constraint precedence constraint timing workflow net(TWF-net) genetic algorithm(GA) concurrent processes scheduling, resource constraint, precedence constraint, tim-ing workflow net (TWF-net), genetic algorithm (GA)
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部