𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics for minimizing mean tardiness for m parallel machines

✍ Scribed by Johnny C. Ho; Yih-Long Chang

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
791 KB
Volume
38
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and due dates for single and rn parallel machines. For the single-machine case, the proposed heuristic is compared with the well-known Wilkerson and Irwin algorithm; for the rn parallel machine case, it is compared with an extension of the Wilkerson-Irwin algorithm. We also introduce a simple dispatching rule, and it is compared with some existing dispatching rules. The comprehensive simulation results show that the proposed heuristic performs better than the Wilkerson-Irwin algorithm at a significantly reduced computational time.

πŸ“œ SIMILAR VOLUMES

Heuristics for minimizing total weighted
Heuristics for minimizing total weighted tardiness in flexible flow shops
✍ Ya Yang; Stephan Kreipl; Michael Pinedo πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 156 KB πŸ‘ 1 views

Consider a #exible #ow shop with s stages in series and at each stage a number of identical machines in parallel. There are n jobs to be processed and each job has to go through the stages following the same route. Job j has release date r H , due date d H , weight w H and a processing time p HJ at

Decomposition and hybrid simulated annea
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
✍ Christos Koulamas πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef

A shifting bottleneck heuristic for mini
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
✍ Michael Pinedo; Marcos Singer πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.

A modified shifting bottleneck heuristic
A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
✍ Scott J. Mason; John W. Fowler; W. Matthew Carlyle πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 138 KB

Increases in the demand for integrated circuits have highlighted the importance of meeting customer quality and on-time delivery expectations in the semiconductor industry. A modiΓΏed shifting bottleneck heuristic is developed for minimizing the total weighted tardiness in a semiconductor wafer fabri

Makespan minimization for m parallel ide
Makespan minimization for m parallel identical processors
✍ Johnny C. Ho; Johnny S. Wong πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 803 KB

We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem,