Single-machine scheduling with learning considerations

被引:699
|
作者
Biskup, D [1 ]
机构
[1] Univ Bielefeld, Fac Econ & Business Adm, D-33501 Bielefeld, Germany
关键词
scheduling; learning;
D O I
10.1016/S0377-2217(98)00246-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The focus of this work is to analyze learning in single-machine scheduling problems. It is surprising that the well-known learning effect has never been considered in connection with scheduling problems. It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:173 / 178
页数:6
相关论文
共 50 条