Order scheduling with tardiness objective: improved approximate solutions (Q1754153): Difference between revisions

@@ Property / cites work @@
+Coordinated scheduling of customer orders for quick response
+Normal rank
@@ Property / cites work @@
+A single machine scheduling problem with two-dimensional vector packing constraints
+Normal rank
@@ Property / cites work @@
+A matheuristic approach for the two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+A hybrid heuristic approach for single machine scheduling with release times
+Normal rank
@@ Property / cites work @@
+Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
+Normal rank
@@ Property / cites work @@
+NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
+Normal rank
@@ Property / cites work @@
+New approximate algorithms for the customer order scheduling problem with total completion time objective
+Normal rank
@@ Property / cites work @@
+Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
+Normal rank
@@ Property / cites work @@
+Order scheduling in an environment with dedicated resources in parallel
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
+Normal rank
@@ Property / cites work @@
+Scheduling orders for multiple product types with due date related objectives
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the concurrent open shop problem
+Normal rank
@@ Property / cites work @@
+Open shops with jobs overlap
@@ Property / cites work: Open shops with jobs overlap / rank @@
+Normal rank
@@ Property / cites work @@
+An order scheduling problem with position-based learning effect
+Normal rank