【文件属性】：
文件名称：Anew polynomial algorithm for aparallel identical scheduling problem (2007年)
文件大小：1.19MB
文件格式：PDF
更新时间：2021-05-11 14:41:52
工程技术 论文
Aprecedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort,anew polynomial algorithm is provided which aims to solve the parallel scheduling problem P
网友评论
相关文章
- 论文研究-An Effective Estimation of Distributed Algorithm for Solving Identical Parallel Machine Scheduling Problem with Precedence Constraints.pdf
- A tabu search algorithm for the job shop scheduling problem
- A Polynomial-time Algorithm for the Change-Making Problem.pdf
- Polynomial algorithms for single machine scheduling