Bounded parallel-batching scheduling with two competing agents (Q2434316): 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/s10951-012-0274-0
+Normal rank
@@ Property / OpenAlex ID @@
+W4236206281
@@ Property / OpenAlex ID: W4236206281 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Problems with Two Competing Agents
@@ Property / cites work: Scheduling Problems with Two Competing Agents / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-agent single machine scheduling
@@ Property / cites work: Multi-agent single machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A multiple-criterion model for machine scheduling
@@ Property / cites work: A multiple-criterion model for machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Batching identical jobs
@@ Property / cites work: Batching identical jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425131
@@ Property / cites work: Q3425131 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time on a batch processing machine with job families
+Normal rank
@@ Property / cites work @@
+Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Multi-agent scheduling on a single machine with max-form criteria
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Competitive Two-Agent Scheduling and Its Applications
+Normal rank
@@ Property / cites work @@
+Unbounded parallel-batching scheduling with two competitive agents
+Normal rank
@@ Property / cites work @@
+On the complexity of bi-criteria scheduling on a single batch processing machine
+Normal rank
@@ Property / cites work @@
+Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
+Normal rank
@@ Property / cites work @@
+Single machine batch scheduling with two competing agents to minimize total flowtime
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the problem of two-agent scheduling on a single machine
+Normal rank
@@ Property / cites work @@
+Two-agent scheduling to minimize the total cost
@@ Property / cites work: Two-agent scheduling to minimize the total cost / rank @@
+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 two agents with controllable processing times
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank