Pages that link to "Item:Q1017464"
From MaRDI portal
The following pages link to Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464):
Displaying 5 items.
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
