Time-interval balancing in multi-processor scheduling of composite modular jobs (preliminary description)
The article describes a special time-interval balancing in multi-processor scheduling of composite modular jobs. This scheduling problem is close to just-in-time planning approach. First, brief literature surveys are presented on just-in-time scheduling and due-data/due-window scheduling problems. Further, the problem and its formulation are proposed for the time-interval balanced scheduling of composite modular jobs. The illustrative real world planning example for modular home-building is described. Here, the main objective function consists in a balance between production of the typical building modules (details) and the assembly processes of the building(s) (by several teams). The assembly plan has to be modified to satisfy the balance requirements. The solving framework is based on the following: (i) clustering of initial set of modular detail types to obtain about ten basic detail types that correspond to main manufacturing conveyors; (ii) designing a preliminary plan of assembly for buildings; (iii) detection of unbalanced time periods, (iv) modification of the planning solution to improve the schedule balance. The framework implements a metaheuristic based on local optimization approach. Two other applications (supply chain management, information transmission systems) are briefly described.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringManagementSchedulingSimilar Papers 제목 키워드 기반
Optimizing Multi-DNN Inference on Mobile Devices through Heterogeneous Processor Co-Execution
Deep Neural Networks (DNNs) are increasingly deployed across diverse industries, driving demand for mobile device support. However, existing mobile inference frameworks often rely on a single processor per model, limitin…
SchedulingEvolutionary Acyclic Graph Partitioning
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for mult…
graph partitioningSchedulingA heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints
Computing workflows in heterogeneous multiprocessor systems are frequently modeled as directed acyclic graphs of tasks and data blocks, which represent computational modules and their dependencies in the form of data pro…
Job Shop SchedulingSchedulingBalanced Space- and Time-based Duty-cycle Scheduling for Light-based IoT
In this work, we propose a Multiple Access Control (MAC) protocol for Light-based IoT (LIoT) networks, where the gateway node orchestrates and schedules batteryless nodes duty-cycles based on their location and sleep tim…
SchedulingCADS: Core-Aware Dynamic Scheduler for Multicore Memory Controllers
Memory controller scheduling is crucial in multicore processors, where DRAM bandwidth is shared. Since increased number of requests from multiple cores of processors becomes a source of bottleneck, scheduling the request…
FairnessReinforcement LearningReinforcement Learning (RL)Scheduling