The following pages link to Harun Aydilek (Q296866):
Displayed 15 items.
- Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
- Insider trading with product differentiation (Q405009) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469) (← links)
- Insider trading with different risk attitudes (Q826644) (← links)
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013) (← links)
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)