Pages that link to "Item:Q2147004"
From MaRDI portal
The following pages link to New efficient heuristics for scheduling open shops with makespan minimization (Q2147004):
Displayed 2 items.
- Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions (Q6059861) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)