A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+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 @@
+Constraint-based scheduling: Applying constraint programming to scheduling problems.
+Normal rank
@@ Property / cites work @@
+The job-shop problem and immediate selection
@@ Property / cites work: The job-shop problem and immediate selection / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Solving the Job-Shop Problem
@@ Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A practical use of Jackson's preemptive schedule for solving the job shop problem
+Normal rank
@@ Property / cites work @@
+Adjustment of heads and tails for the job-shop problem
+Normal rank
@@ Property / cites work @@
+Solving various weighted matching problems with constraints
+Normal rank
@@ Property / cites work @@
+Minimizing late jobs in the general one machine scheduling problem
+Normal rank
@@ Property / cites work @@
+Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
+Normal rank
@@ Property / cites work @@
+A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
+Normal rank
@@ Property / cites work @@
+A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to computing optimal schedules for the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Q3738922
@@ Property / cites work: Q3738922 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank