Bi-criteria scheduling on a single parallel-batch machine (Q437901): Difference between revisions

@@ Property / author @@
-Shi-Sheng Li
@@ Property / author: Shi-Sheng Li / rank @@
-Normal rank
@@ Property / author @@
+Shi-Sheng Li
@@ Property / author: Shi-Sheng Li / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C29
@@ Property / Mathematics Subject Classification ID: 90C29 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6058805
@@ Property / zbMATH DE Number: 6058805 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bi-criteria scheduling
@@ Property / zbMATH Keywords: bi-criteria scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity
@@ Property / zbMATH Keywords: complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Pareto-optimal solution
@@ Property / zbMATH Keywords: Pareto-optimal solution / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fully polynomial-time approximation scheme
@@ Property / zbMATH Keywords: fully polynomial-time approximation scheme / rank @@
+Normal rank
@@ 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.1016/j.apm.2011.07.084
+Normal rank
@@ Property / OpenAlex ID @@
+W1965380237
@@ Property / OpenAlex ID: W1965380237 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
+Normal rank
@@ Property / cites work @@
+On scheduling an unbounded batch machine
@@ Property / cites work: On scheduling an unbounded batch machine / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Single machine parallel batch scheduling subject to precedence constraints
+Normal rank
@@ Property / cites work @@
+Complexity of single machine, multi-criteria scheduling problems
+Normal rank
@@ Property / cites work @@
+Multicriteria scheduling
@@ Property / cites work: Multicriteria scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple and bicriteria scheduling: A literature survey
+Normal rank
@@ Property / cites work @@
+On the complexity of bi-criteria scheduling on a single batch processing machine
+Normal rank
@@ Property / cites work @@
+Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Single machine unbounded parallel-batch scheduling with forbidden intervals
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:437901