A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508): Difference between revisions

@@ Property / cites work @@
+A single machine scheduling problem to minimize total early work
+Normal rank
@@ Property / cites work @@
+Open shop scheduling problems with late work criteria.
+Normal rank
@@ Property / cites work @@
+A new adaptive multi-start technique for combinatorial global optimizations
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling on two identical machines with a common due date to maximize total early work
+Normal rank
@@ Property / cites work @@
+Mirror scheduling problems with early work and late work criteria
+Normal rank
@@ Property / cites work @@
+Two-machine flow-shop scheduling to minimize total late work: revisited
+Normal rank
@@ Property / cites work @@
+New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: basics and variants
@@ Property / cites work: Variable neighborhood search: basics and variants / rank @@
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Weighted Late Work
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with multi-agents to minimize total weighted late work
+Normal rank
@@ Property / cites work @@
+Minimizing total late work on a single machine with generalized due-dates
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling a single machine to minimize total late work
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Late Work
+Normal rank
@@ Property / cites work @@
+Optimization by GRASP
@@ Property / cites work: Optimization by GRASP / rank @@
+Normal rank