𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The job shop tardiness problem: A decomposition approach

✍ Scribed by N. Raman; F. Brian Talbot

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
899 KB
Volume
69
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 large step random walk for minimizing
A large step random walk for minimizing total weighted tardiness in a job shop
✍ Stephan Kreipl πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 116 KB πŸ‘ 2 views

We consider a job shop with m machines. There are n jobs and each job has a speciΓΏed sequence to be processed by the machines. Job j has release date rj, due date dj, weight wj and processing time pij on machine i (1; : : : ; m). The objective is to minimize the total weighted tardiness of the n job