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

Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect

โœ Scribed by Ji-Bo Wang; Linhui Sun; Linyan Sun

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
176 KB
Volume
34
Category
Article
ISSN
0307-904X

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

Single-machine scheduling with learning
Single-machine scheduling with learning effect and resource-dependent processing times
โœ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g

Single machine scheduling with exponenti
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
โœ Ji-Bo Wang; Dan Wang; Li-Yan Wang; Lin Lin; Na Yin; Wei-Wei Wang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 472 KB

In this paper we consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the tota