Home About us Contact
|
Home About us Contact | ||
|
|
||
Scheduling Method (scheduling + method)
Selected AbstractsA Simulation-based Production Scheduling Method for Minimizing the Due-date-deviationINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Issue 2 2002Masahiro Arakawa A simulation-based scheduling method for minimizing the due-date-deviation is proposed on the basis of the combination of the BFHS (backward/forward hybrid simulation) method and the parameter-space-search-improvement method. A new schedule generation method named the BFHS/type-D is first developed, in which the information generated during the backward simulation is utilized to control operation-onset timings and job priorities in the forward simulation. Then, after investigation of the backward-simulation characteristics, two parameters are proposed to manipulate the simulation process systematically in relation to due-date-deviation. Furthermore, the best schedule with respect to due-date-deviation is searched for on the space spanned by the two parameters. Finally, the effectiveness and efficiency of the proposed method are demonstrated, not only on a simple job-shop model, but also on a practical large-scale system. [source] A new task scheduling method for distributed programs that require memory managementCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 9 2006Hiroshi Koide Abstract In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long. Copyright © 2005 John Wiley & Sons, Ltd. [source] A case of rule-based heuristics for scheduling hot rolling seamless steel tube productionEXPERT SYSTEMS, Issue 3 2006Jianxiang Li Abstract: A production scheduling problem for hot rolling seamless steel tube at Tianjin Pipe Corporation of China is studied. Considering the complexity of the problem and the acceptable time for solving it, a rule-based heuristic approach is proposed and implemented. The proposed approach is a bottleneck scheduling method and considers simultaneously all production processes in three production units and ,optimizes' them as a whole. Additionally, the running result shows, on average, that a 3% increase in throughput and a 5% reduction in late deliveries have been achieved since the system implementation. [source] Robust global stabilization of linear systems with input saturation via gain schedulingINTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Issue 4 2010Bin Zhou Abstract The problem of robust global stabilization of linear systems subject to input saturation and input-additive uncertainties is revisited in this paper. By taking advantages of the recently developed parametric Lyapunov equation-based low gain feedback design method and an existing dynamic gain scheduling technique, a new gain scheduling controller is proposed to solve the problem. In comparison with the existing ,2 -type gain scheduling controller, which requires the online solution of a state-dependent nonlinear optimization problem and a state-dependent ,2 algebraic Riccati equation (ARE), all the parameters in the proposed controller are determined a priori. In the absence of the input-additive uncertainties, the proposed controller also partially recovers Teel's ,, -type scheduling approach by solving the problem of global stabilization of linear systems with actuator saturation. The ,, -type scheduling approach achieves robustness not only with non-input-additive uncertainties but also requires the closed-form solution to an ,, ARE. Thus, the proposed scheduling method also addresses the implementation issues of the ,, -type scheduling approach in the absence of non-input-additive uncertainties. Copyright © 2009 John Wiley & Sons, Ltd. [source] A Simulation-based Production Scheduling Method for Minimizing the Due-date-deviationINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Issue 2 2002Masahiro Arakawa A simulation-based scheduling method for minimizing the due-date-deviation is proposed on the basis of the combination of the BFHS (backward/forward hybrid simulation) method and the parameter-space-search-improvement method. A new schedule generation method named the BFHS/type-D is first developed, in which the information generated during the backward simulation is utilized to control operation-onset timings and job priorities in the forward simulation. Then, after investigation of the backward-simulation characteristics, two parameters are proposed to manipulate the simulation process systematically in relation to due-date-deviation. Furthermore, the best schedule with respect to due-date-deviation is searched for on the space spanned by the two parameters. Finally, the effectiveness and efficiency of the proposed method are demonstrated, not only on a simple job-shop model, but also on a practical large-scale system. [source] A Robust Control Real-Time Scheduling DesignASIA-PACIFIC JOURNAL OF CHEMICAL ENGINEERING, Issue 3-4 2005Bing Du Today's real-time systems need to be operated under tighter performance specifications, and require more and more constraints to be satisfied. These specifications can only be met when system nonlinearities and constraints are explicitly considered. The paper presents a new H,-nonlinear model predictive control scheduling method to regulate the deadline miss ratio and CPU utilization, and to satisfy the performance specifications. It is difficult to accurately model a real-time multimedia system. H, control theory addresses the issue of worst-case controller design for linear plants subjects to unknown additive disturbances and plant uncertainties. Model predictive methodology is extended to H, controllers for nonlinear systems. A scheduling architecture that includes model uncertainty is proposed. We firstly integrate H, robust optimal control and scheduling theory in order to satisfy trade-offs between control performance and computing resource utilization. Performance evaluation results are demonstrated by simulated examples, and earliest-deadline first (EDF) scheduling results are compared. [source] | ||||||||||