Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine (Q1037662): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.03.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2156976424
@@ Property / OpenAlex ID: W2156976424 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Scheduling shops to minimize the weighted number of late jobs
+Normal rank
@@ Property / cites work @@
+A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
+Normal rank
@@ Property / cites work @@
+Flow shop and open shop scheduling with a critical machine and two operations per job
+Normal rank
@@ Property / cites work @@
+The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
+Normal rank
@@ Property / cites work @@
+Two-stage flowshop scheduling with a common second-stage machine
+Normal rank