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

Single-machine scheduling with learning effect and resource-dependent processing times

โœ Scribed by Dan Wang; Ming-Zheng Wang; Ji-Bo Wang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
206 KB
Volume
59
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. We analyse the problem with two different processing time functions. For each combination of these, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation.

๐Ÿ“œ SIMILAR VOLUMES

Single-machine group scheduling with res
Single-machine group scheduling with resource allocation and learning effect
โœ 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

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