Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2009.04.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1990514741
@@ Property / OpenAlex ID: W1990514741 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
+Normal rank
@@ Property / cites work @@
+A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Modeling realistic hybrid flexible flowshop scheduling problems
+Normal rank
@@ Property / cites work @@
+An alternative framework to Lagrangian relaxation approach for job shop scheduling.
+Normal rank
@@ Property / cites work @@
+A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
+Normal rank
@@ Property / cites work @@
+Surrogate gradient algorithm for Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+New bundle methods for solving Lagrangian relaxation dual problems
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search for total tardiness minimization in flowshop scheduling problems
+Normal rank