✦ LIBER ✦

Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms

✍ Scribed by Imran Ali Chaudhry; Paul R. Drake

Publisher: Springer
Year: 2008
Tongue: English
Weight: 548 KB
Volume: 42
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-008-1617-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimising total tardiness for the worke

Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models

✍ Po-Chieng Hu 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 246 KB

Further study of minimizing total tardin

Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

✍ Po-Chieng Hu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 194 KB

Minimizing total flow time for the worke

Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models

✍ Po-Chieng Hu 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 197 KB

Further study of minimizing total flowti

Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models

✍ Po-Chieng Hu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 163 KB

Minimizing flow time for the worker assi

Minimizing flow time for the worker assignment problem in identical parallel machine models using GA

✍ Imran Ali Chaudhry 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 460 KB

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an