A two-machine flowshop problem with two agents (Q709115): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2081899110
@@ Property / OpenAlex ID: W2081899110 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / 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 @@
+Sequencing games
@@ Property / cites work: Sequencing games / rank @@
+Normal rank
@@ Property / cites work @@
+On games corresponding to sequencing situations with ready times
+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 @@
+A note on the scheduling with two families of jobs
+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 @@
+A note on the complexity of the problem of two-agent scheduling on a single machine
+Normal rank
@@ Property / cites work @@
+Multi-agent single machine scheduling
@@ Property / cites work: Multi-agent single machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-agent scheduling on a single machine with max-form criteria
+Normal rank
@@ Property / cites work @@
+Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
+Normal rank
@@ Property / cites work @@
+A Lagrangian approach to single-machine scheduling problems with two competing agents
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem             <i>n / 2 / F / F¯</i>
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling to minimize mean flow time
+Normal rank
@@ Property / cites work @@
+An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
+Normal rank
@@ Property / cites work @@
+An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time in two-machine flow shops with exact delays
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+A dual algorithm for the one-machine scheduling problem
+Normal rank