A study on open shop scheduling to minimise total tardiness (Q2967576): Difference between revisions

@@ Property / cites work @@
+A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A branch \(\&\) bound algorithm for the open-shop problem
+Normal rank
@@ Property / cites work @@
+Algorithms for Solving Production-Scheduling Problems
+Normal rank
@@ Property / cites work @@
+A new lower bound for the open-shop problem
@@ Property / cites work: A new lower bound for the open-shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling flexible flow lines with sequence-dependent setup times
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for flexible job shop scheduling with fuzzy processing time
+Normal rank
@@ Property / cites work @@
+An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
+Normal rank
@@ Property / cites work @@
+Scheduling preemptive open shops to minimize total tardiness
+Normal rank
@@ Property / cites work @@
+A contribution and new heuristics for open shop scheduling
+Normal rank
@@ Property / cites work @@
+A study of integer programming formulations for scheduling problems
+Normal rank
@@ Property / cites work @@
+An improved genetic algorithm for the flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
+Normal rank
@@ Property / cites work @@
+A new particle swarm optimization for the open shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Comparative evaluation of MILP flowshop models
@@ Property / cites work: Comparative evaluation of MILP flowshop models / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+New MILP models for the permutation flowshop problem
+Normal rank