by frogger8 on 1/3/25, 12:19 AM with 5 comments
The restaurant has 23 employees. The goal is to create a schedule that satisfies all the constraints below. Each shift must be completely staffed, and no rules can be violated.
Employees: There are 23 employees with the following specialties:
Chefs (C): Alice, Bob, Charlie, David, Evelyn Servers (S): Fiona, George, Hannah, Ian, Julia, Kevin, Lily, Mason, Natalie, Olivia Hosts (H): Peter, Quinn, Rachel, Sam Dishwashers (D): Tim, Ursula, Victor
Full details https://chatgpt.com/share/67772c03-977c-8007-acb0-6881fdabae42
Answer generated by claude https://claude.site/artifacts/ce387d7f-cd9a-4440-9ba1-b4cc366a70bd
by talldayo on 1/3/25, 12:20 AM
by brudgers on 1/4/25, 7:17 PM
An LLM might be able to solve a toy scale problem with only four operations and lots of "machines." But I am skeptical it can solve problems of "interesting size" more effectively than numerical techniques because verification is also in NP. {3} Good luck.
{1} https://en.wikipedia.org/wiki/Job_shop_scheduling
{2} "All shifts covered" seems like a requirement for optimality.
{3} Assuming the problem is Job Shop Scheduling.
by frogger8 on 1/3/25, 12:19 AM