Scheduling with two competing agents to minimize total weighted earliness (Q2399317): 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/s10479-016-2310-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2520890933
@@ Property / OpenAlex ID: W2520890933 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiagent Scheduling
@@ Property / cites work: Multiagent Scheduling / 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 @@
+Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures
+Normal rank
@@ Property / cites work @@
+Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
+Normal rank
@@ Property / cites work @@
+Two-agent scheduling on uniform parallel machines with min-max criteria
+Normal rank
@@ Property / cites work @@
+Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
+Normal rank
@@ Property / cites work @@
+Scheduling problems with two competing agents to minimized weighted earliness-tardiness
+Normal rank
@@ Property / cites work @@
+Single machine just‐in‐time scheduling problems with two competing agents
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+Solving a two-agent single-machine scheduling problem considering learning effect
+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 @@
+Single machine scheduling with two competing agents and equal job processing times
+Normal rank
@@ Property / cites work @@
+Scheduling two agents with controllable processing times
+Normal rank
@@ Property / cites work @@
+Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
+Normal rank