A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611): Difference between revisions

@@ Property / cites work @@
+Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
+Normal rank
@@ Property / cites work @@
+Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The three-machine proportionate flow shop problem with unequal machine speeds
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize the number of early and tardy jobs
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Review of the ordered and proportionate flow shop scheduling research
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+The Three-Machine No-Wait Flow Shop is NP-Complete
+Normal rank
@@ Property / cites work @@
+The just-in-time scheduling problem in a flow-shop scheduling system
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted completion time in a proportionate flow shop
+Normal rank