A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints
Summary: The paper presents a novel hybrid genetic algorithm (HGA) for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines. The objective is to minimize total tardiness, since delays of the jobs may lead to punishment cost or cancellation of orders by the clients in many situations. A priority rule-based heuristic algorithm, which schedules a prior job on a prior machine according to the priority rule at each iteration, is suggested and embedded to the HGA for initial feasible schedules that can be improved in further stages. Computational experiments are conducted to show that the proposed HGA performs well with respect to accuracy and efficiency of solution for small-sized problems and gets better results than the conventional genetic algorithm within the same runtime for large-sized problems.
- 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
- 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
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
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)
