摘要
讨论加工时间服从指数分布的单机随机调度问题 ,目标是实现工件完成时间与公共交货期偏差的加权和的期望最小化。此问题是 JIT(Just- In- Time)生产环境下的典型调度模型。结果表明问题的最优解关于权值与加工时间均值的商具有 Λ形特征。
In this paper, a single machine scheduling with exponentially distributed random processing times is considered, the objective is to find an optimal schedule to minimize the expected total weighted deviations of completion times from a common due date. This problem is a typical scheduling model in JIT(Just-In-Time) production environment. It is shown that the optimal schedules of the problem are Λ-shaped with respect to w iλ i(=w i/E(p i), i.e., the sequence of w iλ i has a single local maximum, where w i,p i and λ i denote the weight, processing time and processing time rate of job i,respectively.
出处
《系统工程》
CSCD
北大核心
2002年第6期58-61,共4页
Systems Engineering
基金
天津市自然科学基金资助项目 (0 136 0 0 711)
关键词
加工时间
指数分布
单机随机调度
∧形调度
Single Machine Scheduling
Random Processing Time
Exponential Distribution
Common Due Date
Λ-Shaped Schedule
