𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

✍ Scribed by Imen Essafi; Yazid Mati; Stéphane Dauzère-Pérès

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
234 KB
Volume
35
Category
Article
ISSN
0305-0548

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