两类加工工夫可变的现代排序问题.pdfVIP

Two modern scheduling problems with varying processing times Abstract Scheduling is an important problem in combinatorial optimization. The processing time of a job is a fixed constant in the classical scheduling. However, in the real word, the processing time of the job may be dependent on its position in a schedule, its starting time or characteristics. Modern scheduling problem with varying processing times is the expansion of the classical scheduling p