The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2005.12.027
+Normal rank
@@ Property / OpenAlex ID @@
+W2032041770
@@ Property / OpenAlex ID: W2032041770 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling multi-operation jobs on a single machine
+Normal rank
@@ Property / cites work @@
+Batch scheduling to minimize maximum lateness
@@ Property / cites work: Batch scheduling to minimize maximum lateness / rank @@
+Normal rank
@@ Property / cites work @@
+The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+On the Complexity of Scheduling with Batch Setup Times
+Normal rank