Scheduling Problems with Production and Consumption of Resources

摘要：

This paper presents project scheduling problems with production and consumption of resources which include non-renewable and renewable resource problems. The problem of finding a feasible schedule of such problems is NP-Hard. We study a new model. We obtain polynomial algorithms for finding an optimal solution in terms of minimization of the makespan in specific cases where we have a partial or complete arbitrage.

关键词： Project management and scheduling Complexity theory

作者: Jacques CARLIER Aziz MOUKRIM Huang XU

作者单位: Laboratoire HEUDIASYC UMR CNRS 6599 Université de Technologie de Compiègne,BP 20529 60205 Compiègne cedex,France

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

在线出版日期: 2007-05-30（万方平台首次上网日期，不代表论文的发表时间）