调度(生产过程)
作业车间调度
拖延
数学优化
地铁列车时刻表
作业调度程序
动态优先级调度
作者
Muminu O. Adamu,Aderemi O. Adewumi
出处
期刊:Journal of Industrial and Management Optimization
[American Institute of Mathematical Sciences]
日期:2013-10-01
卷期号:10 (1): 219-241
被引量:33
标识
DOI:10.3934/jimo.2014.10.219
摘要
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time $p_j$ and due date $d_j$. The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job $j$ is $C_j>d_j$ and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.
科研通智能强力驱动
Strongly Powered by AbleSci AI