Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067): Difference between revisions

@@ Property / cites work @@
+Q3942735
@@ Property / cites work: Q3942735 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness in a two-machine unit-time job shop
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for a job shop problem
@@ Property / cites work: An efficient algorithm for a job shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+Total completion time minimization in two-machine job shops with unit-time operations
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q3737196
@@ Property / cites work: Q3737196 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
+Normal rank
@@ Property / cites work @@
+Is a unit-job shop not easier than identical parallel machines?
+Normal rank