High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471): Difference between revisions

@@ Property / DOI @@
-.1007/s10951-016-0475-z
@@ Property / DOI: 10.1007/s10951-016-0475-z / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6653507
@@ Property / zbMATH DE Number: 6653507 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+high-multiplicity
@@ Property / zbMATH Keywords: high-multiplicity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+availability constraints
@@ Property / zbMATH Keywords: availability constraints / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-016-0475-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2331986476
@@ Property / OpenAlex ID: W2331986476 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with forbidden start times
+Normal rank
@@ Property / cites work @@
+A framework for the complexity of high-multiplicity scheduling problems
+Normal rank
@@ Property / cites work @@
+Operator non-availability periods
@@ Property / cites work: Operator non-availability periods / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with high multiplicity
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotically exact algorithm for the high-multiplicity bin packing problem
+Normal rank
@@ Property / cites work @@
+Exact and approximate algorithms for high-multiplicity parallel machine scheduling
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with small operator-non-availability periods
+Normal rank
@@ Property / DOI @@
+.1007/S10951-016-0475-Z
@@ Property / DOI: 10.1007/S10951-016-0475-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:341471