// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Assign jobs to the least-loaded worker
// Not compiled or tested in-world
// Setup: Place in a spare owned prim. Set positive job DURATIONS, at most12. Owner touch runs a bounded local calculation.
// Stop / restore: Disable/remove. No travel, publication, payments or external operations occur.
// Notes: Input order affects the heuristic. This simulates scheduling only and does not delegate work.
// License: see LICENSE in this distribution.
// Original Incoprea. MIT. Local planning demonstration.
list DURATIONS=[3.0,7.0,2.0,5.0,4.0,1.0];
default
{
    touch_start(integer detectedCount)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        if(llGetListLength(DURATIONS)>12)
        {
            llOwnerSay("At most12 jobs.");
            return;
        }
        list loads=[0.0,0.0,0.0];
        integer i;
        for(i=0;i<llGetListLength(DURATIONS);++i)
        {
            float duration=llList2Float(DURATIONS,i);
            if(duration<=0.0)
            {
                llOwnerSay("Positive durations required.");
                return;
            }
            integer best=0;
            integer worker;
            for(worker=1;worker<3;++worker)if(llList2Float(loads,worker)<llList2Float(loads,best))best=worker;
            float start=llList2Float(loads,best);
            loads=llListReplaceList(loads,[start+duration],best,best);
            llOwnerSay("Job "+(string)i+" worker="+(string)best+" start="+(string)start);
        }
        llOwnerSay("Worker loads="+llDumpList2String(loads,","));
    }
}