Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252): Difference between revisions

@@ Property / cites work @@
+Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
+Normal rank
@@ Property / cites work @@
+Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
+Normal rank
@@ Property / cites work @@
+A linear programming-based method for job shop scheduling
+Normal rank
@@ Property / cites work @@
+Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
+Normal rank
@@ Property / cites work @@
+A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
+Normal rank
@@ Property / cites work @@
+Ant colony optimization combined with taboo search for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
+Normal rank
@@ Property / cites work @@
+Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
+Normal rank
@@ Property / cites work @@
+Non-approximability of just-in-time scheduling
@@ Property / cites work: Non-approximability of just-in-time scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
+Normal rank
@@ Property / cites work @@
+A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
+Normal rank
@@ Property / cites work @@
+An exact algorithm for single-machine scheduling without machine idle time
+Normal rank
@@ Property / cites work @@
+A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
+Normal rank