Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241): 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.1016/j.tcs.2012.08.031
+Normal rank
@@ Property / OpenAlex ID @@
+W2077843589
@@ Property / OpenAlex ID: W2077843589 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
+Normal rank
@@ Property / cites work @@
+A note on scheduling equal-length jobs to maximize throughput
+Normal rank
@@ Property / cites work @@
+On the complexity of minimizing the number of late jobs in unit time open shop
+Normal rank
@@ Property / cites work @@
+Q4016820
@@ Property / cites work: Q4016820 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3206647
@@ Property / cites work: Q3206647 / rank @@
+Normal rank
@@ Property / cites work @@
+Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
+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 @@
+A better algorithm for sequencing with release and delivery times on identical machines
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with release times and tails
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1929241