๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Machine scheduling problems with a general learning effect

โœ Scribed by Xingong Zhang; Guangle Yan


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
494 KB
Volume
51
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Some single-machine scheduling problems
โœ Chin-Chia Wu; Yunqiang Yin; Shuenn-Ren Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called ''sum-of processing-times-based learning'' in which the actual processing time of a job is a nonincreasing function of the jobs already processed. However, the actual processing time of a

Single-machine scheduling with general l
โœ Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 262 KB

Learning effect Sum of completion times square Weighted sum of completion times Maximum lateness Number of tardy jobs a b s t r a c t In this study we consider the single-machine scheduling problem with a sum-ofprocessing-times-based learning effect. The sum-of-processing-times-based learning effec

Single-machine group scheduling with res
โœ Zhanguo Zhu; Linyan Sun; Feng Chu; Ming Liu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

This paper addresses single-machine scheduling problems under the consideration of learning effect and resource allocation in a group technology environment. In the proposed model of this paper the actual processing times of jobs depend on the job position, the group position, and the amount of reso