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

A note on one-processor scheduling with asymmetric earliness and tardiness penalties

โœ Scribed by Chung-Lun Li; Z.L Chen; T.C.E Cheng

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
200 KB
Volume
13
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling stochastic jobs with asymmetr
Scheduling stochastic jobs with asymmetric earliness and tardiness penalties
โœ X. Cai; S. Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 158 KB

We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and kn

A branch and bound approach for single m
A branch and bound approach for single machine scheduling with earliness and tardiness penalties
โœ Pei Chann Chang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 660 KB

An n job, single machine scheduling problem in which each job has a distinct due date, dd, is studied in this paper. The objective is to determine an optimal schedule Ir ยฐ for a set of jobs, S, such that the total absolute deviation of the schedule is minimized. This objective function is based on t

Scheduling jobs with random processing t
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
โœ X. Cai; F. S. Tu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec