Consider a game with a number of possible player actions. Actions are limited to a fixed distribution (N of X, M of Y etc). Each action has a duration cost. The actions are represented as cards, one card per action in the distribution.
Arbitrarily order the players. In turn order each player draughts an action from the available set of actions and places it at the end of a growing sequence of action cards. Do this until all actions have been placed into that sequence. Put the player markers on the first, second, third etc cards in the sequence in accordance with their initial player ordering.
The player whose marker is earliest on the action card track has the current turn. On their turn a player does an action. They either do the action of the card their marker is on or pay a fee and to move their marker to and do an action further ahead in the line. The fee is proportional to how far ahead they go. Action cards which have player markers on them are not available. After doing their selected action the player moves their marker forward by a number of cards equal to the duration cost of the action they selected. The card for the executed action is discarded. Depending on the duration and placement of their action selections a player may have multiple turns in a row. Any cards which end up earlier than all player markers upon a different player taking a turn are put at the other end of the action card track in an order selected by the active player.
This process repeats until some round ending condition (eg all of two actions done or only N possible actions left in the track) . The next round starts with building a new action track using the discarded cards on the end of the current track.