Green manufacturing (especially the right production scale) and optimization of logistics transportation to ensure economic benefits) have become challenging issues. This paper focuses on planning scheduling dynamic supply chain via H∞ control scheme. considers scale resource complex under impact COVID-19 pandemic.Firstly, information green is collected, a new mathematical model including multi...

Modern parallel platforms, such as clouds or servers, are often shared among many different jobs. However, existing programming runtime systems designed and optimized for running a single job, so it is generally hard to directly use them schedule multiple jobs without incurring high overhead inefficiency. In this work, we develop AMCilk (Adaptive Multiprogrammed Cilk), novel system framework, s...

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. To overcome some of the limitations of traditional Gang scheduling algorithms, Concurrent Gang is proposed as a class of scheduling policies which allows the exible and simultaneous scheduling of multi...

We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-time embedded systems. These algorithms attempt to provide low-cost solutions to fault tolerance, graceful performance degradation, and load shedding in such systems by exploiting tradeoffs between space and/or time redundancy, timing accuracy, and quality of service. We place fault-tolerant schedul...

The problem of scheduling a set of tasks to a set of processors can be divided into two categories: job scheduling and scheduling and mapping. In the former category, independent jobs are to be scheduled among the processors of a distributed computing system to optimize overall system performance [1][2]. In contrast, the scheduling and mapping problem requires the allocation of multiple interac...

The problem of how to dynamically schedule a receiver to detect multiple emitters is modeled as a sensor resource allocation problem. It is shown how to specify a variety of receiver-based dynamic scan scheduling strategies that dynamically focus a sensor in different frequency bands so as to develop and maintain good information about an emitter environment. We contrast dynamic and “fixed” sch...

In this paper, we illustrate the impact of dynamic resizability on parallel scheduling. Our ReSHAPE framework includes an application scheduler that supports dynamic resizing of parallel applications. We propose and evaluate new scheduling policies made possible by our ReSHAPE framework. The framework also provides a platform to experiment with more interesting and sophisticated scheduling poli...