Pages that link to "Item:Q490241"

The following pages link to Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241):

Displayed 4 items.

• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) ‎ (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) ‎ (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) ‎ (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) ‎ (← links)