✦ LIBER ✦

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

✍ Scribed by Wlodzimierz Szwarc

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 771 KB
Volume: 40
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199303)40:2<229::aid-nav3220400207>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

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 under which the problem can be decomposed into smaller subproblems. The branching scheme that used the developed results was tested on 70 examples of size n = 10. This scheme should be incorporated in any branch-and-bound method once a lower bound is found. The branching scheme can easily handle small problems without a lower bound. 0 1993

📜 SIMILAR VOLUMES

Scheduling with earliness and tardiness

Scheduling with earliness and tardiness penalties

✍ Michael C. Ferris; Milan Vlach 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

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

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

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

Optimal timing schedules in earliness-ta

Optimal timing schedules in earliness-tardiness single machine sequencing

✍ Wlodzimierz Szwarc; Samar K. Mukhopadhyay 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

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 perform

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