Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
From MaRDI portal
Publication:833543
DOI10.1016/J.COR.2009.02.012zbMath1176.90247OpenAlexW2054944815MaRDI QIDQ833543
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.012
genetic algorithmsequence-dependent setup timesprecedence constraintsbi-objective parallel machine scheduling
Related Items (9)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Effect of solution representations on tabu search in scheduling applications ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ A metaheuristic algorithm to transporter scheduling for assembly blocks in a shipyard considering precedence and cooperating constraints
Cites Work
- Unnamed Item
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Parallel machine scheduling with earliness and tardiness penalties
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- List scheduling in a parallel machine environment with precedence constraints and setup times
- A tabu search algorithm for parallel machine total tardiness problem
- Scheduling parallel processors to minimize setup time
- On the Complexity of Scheduling with Batch Setup Times
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
This page was built for publication: Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
