Pages that link to "Item:Q1617290"
From MaRDI portal
The following pages link to A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290):
Displaying 14 items.
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag (Q2108105) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Machine scheduling with soft precedence constraints (Q2282538) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- 0-1 mathematical programming models for flexible process planning (Q6112702) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
