✦ LIBER ✦

A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

✍ Scribed by Amir Hamidinia; Sahand Khakabimamaghani; Mohammad Mahdavi Mazdeh; Mostafa Jafari

Book ID: 113536702
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 666 KB
Volume: 62
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2011.08.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A genetic local search algorithm for min

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

✍ Imen Essafi; Yazid Mati; Stéphane Dauzère-Pérès 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Genetic algorithm based scheduling of pa

Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness

✍ Balasubramanian, Hari; Mönch, Lars; Fowler, John; Pfund, Michele 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 190 KB

A memetic algorithm for minimizing total

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

✍ Tsung-Che Chiang; Hsueh-Chien Cheng; Li-Chen Fu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Minimizing weighted tardiness of job-sho

Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm

✍ Hong Zhou; Waiman Cheung; Lawrence C. Leung 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 350 KB

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

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.