生产调度-2008.pdf

Scheduling Problem Allocate scarce resources to tasks Production Planning and Scheduling Combinatorial optimization problem 生产计划与调度 Maximize profit Subject to constraints Mathematical techniques and heuristics 赵 均 浙江大学工业控制研究所 How hard is this problem Complexity Theory Assume that n jobs are to be processed through m machines. For each Classic scheduling theory draws heavily on machine, there is n! different ordering of the jobs. there are totally (n!)m possible schedules. Thus a 20x10 problem can have at most complexity theory 7.2651x10183 possible solutions. The complexity of an algorithm is its running The classic MT10(10*10) problem proposed in 1963 was solved after time in terms of the input parameters (e.g., 25 years Scheduling Problem is not only NP hard but also know to be the worst number of jobs and number of machines) member of its class. 2