✦ LIBER ✦

Single-machine scheduling with time windows and earliness/tardiness penalties

✍ Scribed by Christos Koulamas

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 876 KB
Volume: 91
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00116-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Common due date scheduling problem with

Common due date scheduling problem with separate earliness and tardiness penalties

✍ Parthasarati Dileepan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

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