A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104): Difference between revisions

@@ Property / author @@
-Naoki Katoh
@@ Property / author: Naoki Katoh / rank @@
-Normal rank
@@ Property / author @@
+Naoki Katoh
@@ Property / author: Naoki Katoh / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
+Normal rank
@@ Property / cites work @@
+Stochastic spanning tree problem
@@ Property / cites work: Stochastic spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Equipollent Resource Allocation Problem
+Normal rank
@@ Property / cites work @@
+Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
+Normal rank
@@ Property / cites work @@
+AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(83)90038-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2032618916
@@ Property / OpenAlex ID: W2032618916 / rank @@
+Normal rank