Pages that link to "Item:Q1970336"
From MaRDI portal
The following pages link to Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems (Q1970336):
Displaying 5 items.
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines (Q2446341) (← links)
