paper-with-me

Papers

The Practimum-Optimum Algorithm for Manufacturing Scheduling: A Paradigm Shift Leading to Breakthroughs in Scale and Performance

2024-08-19 · Moshe BenBassat

The Practimum-Optimum (P-O) algorithm represents a paradigm shift in developing automatic optimization products for complex real-life business problems such as large-scale manufacturing scheduling. It leverages deep business domain expertise to create a group of virtual human expert (VHE) agents with different "schools of thought" on how to create high-quality schedules. By computerizing them into algorithms, P-O generates many valid schedules at far higher speeds than human schedulers are capable of. Initially, these schedules can also be local optimum peaks far away from high-quality schedules. By submitting these schedules to a reinforced machine learning algorithm (RL), P-O learns the weaknesses and strengths of each VHE schedule, and accordingly derives reward and punishment changes in the Demand Set that will modify the relative priorities for time and resource allocation that jobs received in the prior iteration that led to the current state of the schedule. These cause the core logic of the VHE algorithms to explore, in the subsequent iteration, substantially different parts of the schedules universe and potentially find higher-quality schedules. Using the hill climbing analogy, this may be viewed as a big jump, shifting from a given local peak to a faraway promising start point equipped with knowledge embedded in the demand set for future iterations. This is a fundamental difference from most contemporary algorithms, which spend considerable time on local micro-steps restricted to the neighbourhoods of local peaks they visit. This difference enables a breakthrough in scale and performance for fully automatic manufacturing scheduling in complex organizations. The P-O algorithm is at the heart of Plataine Scheduler that, in one click, routinely schedules 30,000-50,000 tasks for real-life complex manufacturing operations.

📄 PDF Abstract BibTeX arXiv:2408.10040

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

A System-Level Energy-Efficient Digital Twin Framework for Runtime Control of Batch Manufacturing Processes

2023-09-18 · Hongliang Li, Herschel C. Pangborn, Ilya Kovalenko

The manufacturing sector has a substantial influence on worldwide energy consumption. Therefore, improving manufacturing system energy efficiency is becoming increasingly important as the world strives to move toward a m…

Decision MakingScheduling

A Reinforcement Learning Approach for Scheduling Problems With Improved Generalization Through Order Swapping

2023-02-27 · Deepak Vivekanandan, Samuel Wirth, Patrick Karlbauer, Noah Klarmann

The scheduling of production resources (such as associating jobs to machines) plays a vital role for the manufacturing industry not only for saving energy but also for increasing the overall efficiency. Among the differe…

Computational Efficiencyreinforcement-learningReinforcement Learning (RL)Scheduling

Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics

2022-12-14 · Florian Wimmenauer, Matúš Mihalák, Mark H. M. Winands

In manufacturing, the production is often done on out-of-the-shelf manufacturing lines, whose underlying scheduling heuristics are not known due to the intellectual property. We consider such a setting with a black-box j…

Job Shop SchedulingScheduling

Curiosity Based Reinforcement Learning on Robot Manufacturing Cell

2020-11-17 · Mohammed Sharafath Abdul Hameed, Md Muzahid Khan, Andreas Schwung

This paper introduces a novel combination of scheduling control on a flexible robot manufacturing cell with curiosity based reinforcement learning. Reinforcement learning has proved to be highly successful in solving tas…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Scheduling

Solving Integrated Process Planning and Scheduling Problem via Graph Neural Network Based Deep Reinforcement Learning

2024-09-02 · Hongpei Li, Han Zhang, Ziyan He, Yunkai Jia 외

The Integrated Process Planning and Scheduling (IPPS) problem combines process route planning and shop scheduling to achieve high efficiency in manufacturing and maximize resource utilization, which is crucial for modern…

Deep Reinforcement LearningGraph Neural NetworkScheduling