The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546): Difference between revisions

Latest revision as of 01:03, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic	scientific article

Statements

instance of

scholarly article

0 references

title

The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (English)

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

12 July 2018

0 references

full work available at URL

https://idus.us.es/handle//11441/96664

0 references

zbMATH Keywords

scheduling

0 references

assembly

0 references

completion time

0 references

heuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5437765

0 references

Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

0 references

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

0 references

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

0 references

The two-stage assembly scheduling problem to minimize total completion time with setup times

0 references

A new set of high-performing heuristics to minimise flowtime in permutation flowshops

0 references

Manufacturing Scheduling Systems

0 references

New approximate algorithms for the customer order scheduling problem with total completion time objective

0 references

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

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

Order scheduling in an environment with dedicated resources in parallel

0 references

Variable neighborhood search

0 references

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

0 references

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

0 references

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

0 references

Minimizing the total completion time in a distributed two stage assembly system with setup times

0 references

Identifiers

zbMATH Open document ID

1391.90263

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2017.07.012

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1651546

@@ Property / DOI @@
-.1016/j.cor.2017.07.012
@@ Property / DOI: 10.1016/j.cor.2017.07.012 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.07.012
@@ Property / DOI: 10.1016/J.COR.2017.07.012 / rank @@
+Normal rank