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

Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method

โœ Scribed by Xiangton Qi; Feng-Sheng Tu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
404 KB
Volume
105
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper considers a single machine scheduling problem. There are n jobs to be processed on a single machine. The problem is to minimize total earliness penalties subject to no tardy jobs. The problem is NP-complete if the due-dates are arbitrary. We study the problem when the due-dates are determined by the equal slack (SLK) method. Two special cases of the problem are solved in polynomial time. The first one is the problem with equally weighted monotonous penalty objective function. The second one is the problem with weighted linear penalty objective function. (~) 1998 Elsevier Science B.V.

๐Ÿ“œ SIMILAR VOLUMES

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

Scheduling of a single machine to minimi
Scheduling of a single machine to minimize total weighted completion time subject to release dates
โœ Lucio Bianco; Salvatore Ricciardelli ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 764 KB

## Abstract In this paper the __n__/1/__r__~j~ ฮฃ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are