A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286): Difference between revisions

Latest revision as of 06:44, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times	scientific article

Statements

instance of

scholarly article

0 references

title

A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

11 May 2007

0 references

zbMATH Keywords

assembly flowshop

0 references

scheduling

0 references

maximum lateness

0 references

self-adaptive differential evolution

0 references

setup times

0 references

heuristic

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2006.09.011

0 references

cites work

Q5437765

0 references

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

0 references

A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

0 references

A survey of scheduling problems with setup times or costs

0 references

Tabu search for a class of single-machine scheduling problems

0 references

Optimal scheduling of the 3-machine assembly-type flow shop

0 references

A branch and bound algorithm for the two-stage assembly scheduling problem

0 references

An improved tabu search approach for solving the job shop scheduling problem with tooling constraints

0 references

A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

0 references

The three-stage assembly flowshop scheduling problem

0 references

Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

0 references

Scheduling flow shops using differential evolution algorithm

0 references

Scheduling alternative operations in two-machine flow-shops

0 references

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces

0 references

Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

0 references

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

0 references

A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

0 references

Minimizing Makespan in a Class of Reentrant Shops

0 references

Identifiers

zbMATH Open document ID

1128.90024

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2006.09.011

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:879286

@@ Property / DOI @@
-.1016/j.ejor.2006.09.011
@@ Property / DOI: 10.1016/j.ejor.2006.09.011 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2006.09.011
@@ Property / DOI: 10.1016/J.EJOR.2006.09.011 / rank @@
+Normal rank