New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2016.09.010
@@ Property / DOI: 10.1016/j.cor.2016.09.010 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2520193567
@@ Property / OpenAlex ID: W2520193567 / rank @@
+Normal rank
@@ Property / cites work @@
+Coordinated scheduling of customer orders for quick response
+Normal rank
@@ Property / cites work @@
+The customer order lead-time problem on parallel machines
+Normal rank
@@ Property / cites work @@
+Q5702308
@@ Property / cites work: Q5702308 / rank @@
+Normal rank
@@ Property / cites work @@
+Order scheduling in an environment with dedicated resources in parallel
+Normal rank
@@ Property / cites work @@
+Scheduling orders for multiple product types to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
+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 @@
+Open shops with jobs overlap
@@ Property / cites work: Open shops with jobs overlap / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of customer order scheduling problems on parallel machines
+Normal rank
@@ Property / cites work @@
+Scheduling parallel machines for the customer order problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2016.09.010
@@ Property / DOI: 10.1016/J.COR.2016.09.010 / rank @@
+Normal rank