A note on scheduling problems with competing agents and earliness minimization objectives (Q319703): Difference between revisions

@@ Property / author @@
-Christos P. Koulamas
@@ Property / author: Christos P. Koulamas / rank @@
-Normal rank
@@ Property / author @@
+Christos P. Koulamas
@@ Property / author: Christos P. Koulamas / 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.ejor.2015.04.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2059543744
@@ Property / OpenAlex ID: W2059543744 / 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 @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Competitive Two-Agent Scheduling and Its Applications
+Normal rank
@@ Property / cites work @@
+Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
+Normal rank