Pages that link to "Item:Q5438522"

The following pages link to Relaxed sequencing games have a nonempty core (Q5438522):

Displaying 20 items.

• Step out-step in sequencing games (Q319891) (← links)
• A rescheduling and cost allocation mechanism for delayed arrivals (Q342157) (← links)
• Batch sequencing and cooperation (Q398862) (← links)
• Multi-stage sequencing situations (Q532719) (← links)
• On the balancedness of relaxed sequencing games (Q1395377) (← links)
• Multiple-machine scheduling with learning effects and cooperative games (Q1664951) (← links)
• Shapley value for parallel machine sequencing situation without initial order (Q1665679) (← links)
• On the convexity of step out-step in sequencing games (Q1752351) (← links)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
• Crowding games are sequentially solvable (Q1972605) (← links)
• Games in sequencing situations with externalities (Q1999402) (← links)
• Open shop scheduling games (Q2239840) (← links)
• Sequencing situations and games with non-linear cost functions under optimal order consistency (Q2240010) (← links)
• On interactive sequencing situations with exponential cost functions (Q2272301) (← links)
• Compensation rules for multi-stage sequencing games (Q2348771) (← links)
• Partitioning sequencing situations and games (Q2378467) (← links)
• Job scheduling, cooperation, and control (Q2583703) (← links)
• (Q4836331) (← links)
• The stable gain splitting rule for sequencing situations (Q6168511) (← links)
• Queueing games with an endogenous number of machines (Q6494256) (← links)