Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-21204-8_24
+Normal rank
@@ Property / OpenAlex ID @@
+W190212481
@@ Property / OpenAlex ID: W190212481 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with a single breakdown
+Normal rank
@@ Property / cites work @@
+Operator non-availability periods
@@ Property / cites work: Operator non-availability periods / rank @@
+Normal rank
@@ Property / cites work @@
+Non-preemptive two-machine open shop scheduling with non-availability constraints
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with scheduled maintenance
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3004670