Pages that link to "Item:Q2448222"

The following pages link to A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222):

Displaying 6 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)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
• An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)