Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (Q1788959): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 22:00, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Solving multi-objective parallel machine scheduling problem by a modified NSGA-II	scientific article

Statements

scholarly article

0 references

Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (English)

0 references

Susmita Bandyopadhyay

0 references

Ranjan Bhattacharya

0 references

Applied Mathematical Modelling

0 references

publication date

9 October 2018

0 references

zbMATH Keywords

job sequencing

0 references

multi-objective evolutionary algorithm (MOEA)

0 references

NSGA-II (non-dominated sorting genetic algorithm-II)

0 references

SPEA2

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1016/j.apm.2013.01.050

0 references

The scheduling problem of PCBs for multiple non-identical parallel machines

0 references

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

0 references

Bi-objective ant colony optimization approach to optimize production and maintenance scheduling

0 references

Hybrid flowshop scheduling with machine and resource-dependent processing times

0 references

The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine

0 references

Scheduling interfering job sets on parallel machines

0 references

Coordination mechanisms for parallel machine scheduling

0 references

Exploiting process plan flexibility in production scheduling: A multi-objective approach

0 references

Parallel machine scheduling with a convex resource consumption function

0 references

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

0 references

Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs

0 references

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

0 references

Scheduling on parallel identical machines with job-rejection and position-dependent processing times

0 references

Minimizing makespan subject to minimum flowtime on two identical parallel machines

0 references

Parallel dedicated machines scheduling with chain precedence constraints

0 references

Parallel-machine scheduling with time dependent processing times

0 references

Approximation schemes for two-agent scheduling on parallel machines

0 references

A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.

0 references

Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

0 references

Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

0 references

A united search particle swarm optimization algorithm for multiobjective scheduling problem

0 references

Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach

0 references

Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.APM.2013.01.050

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1788959

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1788959&oldid=38751193"