Sequencing situations and games with non-linear cost functions under optimal order consistency

DOI10.1016/j.ejor.2021.02.013zbMath1487.91008OpenAlexW3129063963MaRDI QIDQ2240010

J. Schouten, Alejandro Saavedra-Nieves, María Gloria Fiestras-Janeiro

Publication date: 5 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.02.013

zbMATH Keywords

game theoryconvexitynonlinear cost functionsstable allocationstime-dependent neighbor switching gains

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The stable gain splitting rule for sequencing situations

Cites Work

• Unnamed Item
• Step out-step in sequencing games
• Sequencing situations with just-in-time arrival, and related games
• On the convexity of precedence sequencing games
• Sequencing games with repeated players
• Sequencing games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A cooperative approach to service booking and scheduling in cloud manufacturing
• Cost allocation in rescheduling with machine unavailable period
• The split core for sequencing games
• On games corresponding to sequencing situations with ready times
• Games in sequencing situations with externalities
• On interactive sequencing situations with exponential cost functions
• A state-of-the-art review on scheduling with learning effects
• Cores of convex games
• Relaxed sequencing games have a nonempty core
• On the convexity of games corresponding to sequencing situations with due dates.

This page was built for publication: Sequencing situations and games with non-linear cost functions under optimal order consistency