𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bicriteria approach to scheduling a single machine with job rejection and positional penalties

✍ Scribed by Dvir Shabtay; Nufar Gaspar; Liron Yedidsion

Book ID
113070656
Publisher
Springer US
Year
2010
Tongue
English
Weight
873 KB
Volume
23
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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