Pages that link to "Item:Q2242240"

The following pages link to The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240):

Displaying 5 items.

• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
• A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs (Q2887142) (← links)
• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502) (← links)