A System for Automated Industrial Test Laboratory Scheduling

Automated scheduling solutions are tremendously important for the efficient operation of industrial laboratories. The Test Laboratory Scheduling Problem (TLSP) is an extension well-known Resource Constrained Project (RCPSP) and captures specific requirements such In addition to several new constraints, it features a grouping phase, where jobs be scheduled assembled from smaller units. this work, we introduce innovative system that allows flexible generation schedules TLSP. It Constraint Programming model covers both aspect, as well hybrid Very Large Neighborhood Search internally uses CP model. Our experimental results on generated real-world benchmark instances show good can obtained even compared settings which have already provided, including best known these instances. algorithms TLSP been successfully implemented in test laboratory. We provide detailed description deployed additional useful soft constraints supported by solvers general lessons learned. This includes discussion choice constraint weights, with analysis impact relation different objectives each other. experiments some complement other well, while others require explicit trade-offs via their relative weights.