Scheduling problems in master-slave model (Q940888): 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-007-0271-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2160288884
@@ Property / OpenAlex ID: W2160288884 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling two-stage hybrid flow shop with availability constraints
+Normal rank
@@ Property / cites work @@
+Q4818873
@@ Property / cites work: Q4818873 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Techniques for Average Completion Time Scheduling
+Normal rank
@@ Property / cites work @@
+A state-of-the-art review of parallel-machine scheduling research
+Normal rank
@@ Property / cites work @@
+Q5501838
@@ Property / cites work: Q5501838 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
+Normal rank
@@ Property / cites work @@
+Scheduling a two-stage hybrid flowshop with separable setup and removal times
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in hybrid flowshops
@@ Property / cites work: Minimizing makespan in hybrid flowshops / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing mean flowtime and makespan on master-slave systems
+Normal rank
@@ Property / cites work @@
+Minimizing average completion time in the presence of release dates
+Normal rank
@@ Property / cites work @@
+Scheduling master-slave multiprocessor systems
@@ Property / cites work: Scheduling master-slave multiprocessor systems / rank @@
+Normal rank
@@ Property / cites work @@
+The master-slave paradigm in parallel computer and industrial settings
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
+Normal rank
@@ Property / cites work @@
+Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
+Normal rank
@@ Property / cites work @@
+Scheduling algorithms for flexible flowshops: Worst and average case performance
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:940888