Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483): 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.1016/j.ejor.2010.03.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2020768508
@@ Property / OpenAlex ID: W2020768508 / 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 @@
+A Lagrangian approach to single-machine scheduling problems with two competing agents
+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 @@
+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 @@
+Scheduling with Opting Out: Improving upon Random Priority
+Normal rank
@@ Property / cites work @@
+Sequencing games
@@ Property / cites work: Sequencing games / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the problem of two-agent scheduling on a single machine
+Normal rank