Writing a list of names, with a limited amount of "active" letters at a time. Algorithm to sort the names to reduce the amount of swapping letters?

While making name-tags for a dinner seating, I stumbled upon a problem which I can’t find any algorithm to solve, and I’m not sure where to begin.

The goal is to write the name of each dinner guest on a card, completing one name at a time.
The names are written with old-fashioned rubber stamps, so only 6 letters can be "active" at any given time. When a new letter is required, one of the active letters has to be swapped out for the new letter.

The problem is to sort the names in such an order, that I need to do the least amount of letter-swapping.

Example
I want to write the names:

• Jack
• Julie
• Chuck

I can do this with 3 letter-swaps
Initial letters: J A C K H U
Write: Jack, Chuck

{swap A, C, K with L, I, E}

New active letters:
J L I E H U
Write: Julie

Now I want to find an algorithm that, given a list of names and a limit of active characters, provide the order of names and which letters to swap at each name, to reduce the total amount of letter-swaps.

Any ideas or pointers are welcome.

Related Questions

How to generate graphs with a Hamiltonian path?

3  Asked on February 21, 2021 by always-newbie

Wifi throughput calculation

1  Asked on February 20, 2021 by copsa

Searching for points near given point in a multidimensional space

1  Asked on February 20, 2021 by saku

Group adjacent sections to create groups with biggest value, value is changing in groups

1  Asked on February 20, 2021 by rossko_dca

Thirty-one game. Prediction of the winner

1  Asked on February 17, 2021 by donvitomarco

Explanation of conventional solutions to the Firing Squad Synchronization problem

0  Asked on February 16, 2021 by von-spotz

If $B$ is worse than $A$ on some inputs, how do their worst-case time complexities compare?

1  Asked on February 13, 2021 by aviv-barel

How to edge-color a directed acyclic graph so that every path visits none or all edges of each color?

5  Asked on February 10, 2021 by gizmo

Complexity of a cutting operation on a list of binary trees

0  Asked on February 10, 2021 by arthur-b

speed of preorder traversal

1  Asked on February 8, 2021 by keith-paton

Mergesort and some claims on comparison

1  Asked on February 7, 2021 by user3661613

Proving the language of non-primes is in NP

1  Asked on February 6, 2021 by builderthebob00

Does writing more data to disk consume more energy than writing less?

0  Asked on February 5, 2021 by pookie

In Strassen’s algorithm, why does padding the matrices with zeros not affect the asymptopic complexity?

1  Asked on February 4, 2021 by retsek680

How to find the language of a CFG from Production rules

1  Asked on February 3, 2021 by stark2022

Machine Learning algorithm for predicting a user’s rating on an item?

0  Asked on February 1, 2021 by david-grnberger

Finding the Hamiltonian cycle that uses the least amount of straight lines

0  Asked on January 30, 2021 by tzlil

Can I have 2 free adjacent nodes in the fit algorithm for data management

0  Asked on January 29, 2021 by angelic-demonic

Longest path on a full tree

1  Asked on January 27, 2021 by bm1125