Pages that link to "Item:Q1803611"
From MaRDI portal
The following pages link to Structure of a simple scheduling polyhedron (Q1803611):
Displayed 50 items.
- Two-agent scheduling in a flowshop (Q322895) (← links)
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- Two-agent scheduling to minimize the total cost (Q421611) (← links)
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule (Q433121) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Submodular function minimization (Q995782) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- Approximability of total weighted completion time with resource consuming jobs (Q1785443) (← links)
- Permutation polytopes corresponding to strongly supermodular functions (Q1878403) (← links)
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
- On scheduling coflows (Q2211360) (← links)
- A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types (Q2957467) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints (Q3602833) (← links)
- SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT (Q4626601) (← links)
- A supermodular relaxation for scheduling with release dates (Q4645930) (← links)