A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints
From MaRDI portal
Publication:460076
zbMATH Open1296.90053MaRDI QIDQ460076FDOQ460076
Authors: Chunfeng Liu 
Publication date: 13 October 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Recommendations
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- A novel hybrid algorithm for minimizing total weighted tardiness cost
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (6)
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
This page was built for publication: A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460076)
