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

Optimal due-date assignment problem with learning effect and resource-dependent processing times

โœ Scribed by Yuan-Yuan Lu, Gang Li, Yu-Bin Wu, Ping Ji

Book ID
120885486
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
230 KB
Volume
8
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
โœ T.C.E. Cheng; C. Oวงuz; X.D. Qi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the