A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-008-0098-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1980489469
@@ Property / OpenAlex ID: W1980489469 / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive scheduling problem and its relevance to UMTS channel assignment
+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 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 @@
+A note on the complexity of the problem of two-agent scheduling on a single machine
+Normal rank
@@ Property / cites work @@
+An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
+Normal rank
@@ Property / cites work @@
+Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
+Normal rank
@@ Property / cites work @@
+Minimizing Weighted Completion Times with Deadlines
+Normal rank