Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (Q990722): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2007.04.063
@@ Property / DOI: 10.1016/j.amc.2007.04.063 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2007.04.063
+Normal rank
@@ Property / OpenAlex ID @@
+W1978109400
@@ Property / OpenAlex ID: W1978109400 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
+Normal rank
@@ Property / cites work @@
+Q4002567
@@ Property / cites work: Q4002567 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
+Normal rank
@@ Property / cites work @@
+Using genetic algorithms for single-machine bicriteria scheduling problems
+Normal rank
@@ Property / cites work @@
+Q2743969
@@ Property / cites work: Q2743969 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+An efficient genetic algorithm for determining the optimal price discrimination
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2007.04.063
@@ Property / DOI: 10.1016/J.AMC.2007.04.063 / rank @@
+Normal rank