Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863): Difference between revisions

@@ Property / cites work @@
+Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
+Normal rank
@@ Property / cites work @@
+Minimizing tardy jobs in a flowshop with common due date
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
+Normal rank
@@ Property / cites work @@
+Permutation flowshop scheduling problems with maximal and minimal time lags
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
+Normal rank
@@ Property / cites work @@
+Logic-based Benders decomposition
@@ Property / cites work: Logic-based Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Planning and Scheduling to Minimize Tardiness
@@ Property / cites work: Planning and Scheduling to Minimize Tardiness / rank @@
+Normal rank
@@ Property / cites work @@
+Planning and Scheduling by Logic-Based Benders Decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+A new rule for minimizing the number of tardy jobs in dynamic flow shops
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank