Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690): Difference between revisions

@@ Property / cites work @@
+Order preserving assignments without contiguity
@@ Property / cites work: Order preserving assignments without contiguity / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive scheduling problem and its relevance to UMTS channel assignment
+Normal rank
@@ Property / cites work @@
+Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
+Normal rank
@@ Property / cites work @@
+Scheduling jobs of equal length: Complexity, facets and computational results
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Polyhedral Characterization of Discrete Dynamic Programming
+Normal rank
@@ Property / cites work @@
+On project scheduling with irregular starting time costs
+Normal rank
@@ Property / cites work @@
+Solving Project Scheduling Problems by Minimum Cut Computations
+Normal rank
@@ Property / cites work @@
+On facets of stable set polytopes of claw-free graphs with stability number 3
+Normal rank
@@ Property / cites work @@
+Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling Polyhedra with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+A set packing model for the ground holding problem in congested networks
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to single-machine scheduling problems.
+Normal rank
@@ Property / cites work @@
+The relation of time indexed formulations of single machine scheduling problems to the node packing problem
+Normal rank
@@ Property / cites work @@
+Strong formulations for mixed integer programming: A survey
+Normal rank
@@ Property / cites work @@
+Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
+Normal rank