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

A two-agent single-machine scheduling problem with a time-based learning effect

โœ Scribed by Liu, Peng ;Rong, Nan ;Yi, Na

Book ID
115495641
Publisher
IEEE
Year
2012
Weight
413 KB
Series
undefined series for scimag
Category
Article

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A two-agent single-machine scheduling pr
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations
โœ T.C.E. Cheng; Shuenn-Ren Cheng; Wen-Hung Wu; Peng-Hsiang Hsu; Chin-Chia Wu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negoti

Some single-machine scheduling problems
Some single-machine scheduling problems with a truncation learning effect
โœ 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