In this paper, we consider the counting problem of matrix of set （Aij）kxn which satisfies Ui=1^k Uj=1 ^n Aij={α1,α2,…αm} and other conditions, and obtain some computational formulas which extend all the results...In this paper, we consider the counting problem of matrix of set （Aij）kxn which satisfies Ui=1^k Uj=1 ^n Aij={α1,α2,…αm} and other conditions, and obtain some computational formulas which extend all the results in [1].展开更多
In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the ...In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.展开更多
基金Supported by the National Natural Science Foundation of China（10771100） Supported by the Natural Science Foundation of Education Committee of Jiangsu Province（06KJD110179）
文摘In this paper, we consider the counting problem of matrix of set （Aij）kxn which satisfies Ui=1^k Uj=1 ^n Aij={α1,α2,…αm} and other conditions, and obtain some computational formulas which extend all the results in [1].
基金Supported by the NSFC(10671183)Supported by the Science Foundation of Henan University of Technology(07XJC002)+1 种基金Supported by the NSF of the Education Department of Henan Province(2008A11004)Supported by the NSF of Henan Province(082300410190)
文摘In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.
