An FPTAS for scheduling with resource constraints (Q6047696): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2023.06.001
@@ Property / DOI: 10.1016/j.orl.2023.06.001 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2023.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W4380997042
@@ Property / OpenAlex ID: W4380997042 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with additional resources: notation, classification, models and solution methods
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of the parallel machine scheduling problem with additional unit resources
+Normal rank
@@ Property / cites work @@
+An efficient fully polynomial approximation scheme for the Subset-Sum problem.
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
+Normal rank
@@ Property / cites work @@
+Q3964013
@@ Property / cites work: Q3964013 / rank @@
+Normal rank
@@ Property / cites work @@
+A cyclical search for the two machine flow shop and open shop to minimise finishing time
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2023.06.001
@@ Property / DOI: 10.1016/J.ORL.2023.06.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6047696