不确定单机排序的一个新的双目标模型和算法

A New Model and Agorithm of Two Objectives for Uncertain Sngle Mchine Sheduling Problem

在单机排序问题中,假设一些任务被分成若干组(称为链),它们分别有一个交货截止日期和权重,任务的处理时间具有不确定性,又缺乏历史的数据.以往人们关心任务链如何排序使得耽误任务的总加权数最小或任务的加权完成时间最小或它们同时最小.本文首先基于不确定理论,视任务的处理时间为不确定变量,建立了一个新的双目标整数规划模型.然后给出了其模型的性质.

In the sngle machine schedul ing problem, suppose that some jobs are divide into some groups（ called chains）. They have a due date and weight respectively. Processing time of job has uncer-tainty and no its historical data. Previous researches are concerned with how schedule a processing se-quence of chains such that the total weighted number of tardy job is minimum or the total weighted com-pletion time of chains is minimum or they is minimum simultaneously. In the paper , a new model of in-tegral number of two objectives first is established based on uncertainty theory. Then, its properties are given.