✦ LIBER ✦

Optimal timing schedules in earliness-tardiness single machine sequencing

✍ Scribed by Wlodzimierz Szwarc; Samar K. Mukhopadhyay

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 339 KB
Volume: 42
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199510)42:7<1109::aid-nav3220420709>3.0.co;2-5

No coin nor oath required. For personal study only.

✦ Synopsis

The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cluster concept we develop properties of the model that lead to a very fast algorithm to find an optimal timing schedule for a given sequence of jobs. The performance of this algorithm is tested on 480 randomly generated problems involving 100,200,400 and 500 jobs. It takes less than two seconds to solve a 500 job problem on a PC.

📜 SIMILAR VOLUMES

Single-machine scheduling with early and

Single-machine scheduling with early and tardy completion costs

✍ J. Steve Davis; John J. Kanet 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 930 KB

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early com

Minimizing weighted earliness and tardin

Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

✍ Jaw-Yeh Chen; Sheng-Fuu Lin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a br

Adjacent orderings in single-machine sch

Adjacent orderings in single-machine scheduling with earliness and tardiness penalties

✍ Wlodzimierz Szwarc 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB

This article deals with a single-machine n job earliness-tardiness model with jobindependent penalties. It demonstrates that the arrangement of adjacent jobs in an optimal schedule depends on a critical value of the start times. Based on these precedence relations, the article develops criteria unde

The single-machine absolute-deviation ea

The single-machine absolute-deviation early-tardy problem with random completion times

✍ Umar M. Al-Turki; John Mittenthal; M. Raghavachari 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal dis

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

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th