Open Issues Need Help
View All on GitHubA modular Python library for creating, solving, and visualizing job shop scheduling problems.
A modular Python library for creating, solving, and visualizing job shop scheduling problems.
AI Summary: Implement a new dispatching rule, 'largest_processing_time', for a job shop scheduling library. This involves creating the rule function, integrating it into the factory system, adding tests, and potentially a scoring function. The rule should select the operation with the longest duration from available operations.
A modular Python library for creating, solving, and visualizing job shop scheduling problems.
AI Summary: Implement a new factory function, `get_arrival_calculator`, in a Python library to create a start time calculator that considers operation arrival times. The function should handle cases where arrival times are provided directly or retrieved from instance metadata, and it should return the maximum of the default start time and the arrival time. Comprehensive unit tests are also required.
A modular Python library for creating, solving, and visualizing job shop scheduling problems.