On interactive sequencing situations with exponential cost functions

DOI10.1016/j.ejor.2019.06.044zbMath1431.91078OpenAlexW2891082223WikidataQ115575527 ScholiaQ115575527MaRDI QIDQ2272301

P. E. M. Borm, J. Schouten, Alejandro Saavedra-Nieves

Publication date: 9 September 2019

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

Full work available at URL: https://research.tilburguniversity.edu/en/publications/79c2d10c-d6b1-4c2a-9212-41fa3767a032

zbMATH Keywords

convexitysequencing gamestime-dependent neighbor switching gainsexponential cost functioninteractive sequencing situation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Applications of game theory (91A80)

Related Items (1)

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

Cites Work

• Step out-step in sequencing games
• Sequencing situations with just-in-time arrival, and related games
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• Sequencing games with controllable processing times
• Sequencing games
• A cooperative approach to service booking and scheduling in cloud manufacturing
• Cost allocation in rescheduling with machine unavailable period
• On games corresponding to sequencing situations with ready times
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review
• Family sequencing and cooperation
• Compensation rules for multi-stage sequencing games
• Partitioning sequencing situations and games
• Sequencing games without initial order
• Cores of convex games
• Cooperation in one machine scheduling
• 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: On interactive sequencing situations with exponential cost functions