Pages that link to "Item:Q3100690"
From MaRDI portal
The following pages link to Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690):
Displaying 6 items.
- Scheduling three chains on two parallel machines (Q1040986) (← links)
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)