𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jaw-Yeh Chen; Sheng-Fuu Lin

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
169 KB
Volume
49
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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 branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. Β© 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039

πŸ“œ 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 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