2008
DOI: 10.1007/s00170-008-1617-z
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 66 publications
(26 citation statements)
references
References 39 publications
0
21
0
Order By: Relevance
“…Chaari et al adopted a genetic algorithm (GA) for a robust HFSSP under demand uncertainty [7]. Chaudhry and Drake applied GA for machine scheduling and worker assignment to minimize total tardiness [9]. Chan et al presented a GA-based job shop scheduler for a flexible, multi-product, parallel-machine sheet-metal job shop [8].…”
Section: Hfssp With Parallel Machinesmentioning
confidence: 99%
“…Chaari et al adopted a genetic algorithm (GA) for a robust HFSSP under demand uncertainty [7]. Chaudhry and Drake applied GA for machine scheduling and worker assignment to minimize total tardiness [9]. Chan et al presented a GA-based job shop scheduler for a flexible, multi-product, parallel-machine sheet-metal job shop [8].…”
Section: Hfssp With Parallel Machinesmentioning
confidence: 99%
“…Chaari et al adopted GA for demand uncertainty of robust HFSSP [3]. Chaudhry and Drake used GA for machine scheduling and worker assignment to minimize total tardiness [5]. Chan et al presented a GA-based job-shop scheduler for a flexible multi-product, parallel machine sheet metal job shop [4].…”
Section: Simulation Optimization and Optimal Computingmentioning
confidence: 99%
“…However, different skill levels were considered. Chaudhry and Drake (2009) also developed a search algorithm based on genetic algorithm for identical parallel machines with worker assignment. They too did not consider sequence dependent setup time, dynamic machine availability times and dynamic job release times.…”
Section: Introductionmentioning
confidence: 99%