Decision support systems are intended to assist human decision makers. In complex, dynamic domains a proper task apportionment between the computer and the human decision maker largely dictates system success. Task apportionment is even more critical when exceptions are introduced into the system. We examine an airbase logistics scheduling and planning system, a complex and dynamic application ...

The scarcity of water compared with the abundance of land constitutes the main drawback within agricultural production. Besides the improvement of irrigation techniques a task of primary importance is solving the problem of intra-seasonal irrigation scheduling under limited seasonal water supply. An efficient scheduling algorithm has to take into account the crops’ response to water stress at d...

The Many Task Computing paradigm was first introduced by Ioan Raicu and could be described shortly as solving a large number of tasks with short time executions (i.e. seconds to minutes long) that are data intensive. We propose MTS: Many Task Scheduling Simulator that can be used for a broad range of simulations after each simulation one can visualize the results. The purpose of MTS framework i...

In a heterogeneous computing (HC) environment consisting of different types of machines, an application program is decomposed into subtasks, each of which is computationally homogeneous. The goal is to execute subtasks on the machines in such a way that the total program execution time is minimized. A mathematical framework is presented that models the matching of subtasks to machines, scheduli...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

The major problem of wind turbines is the great variability of wind power production. The dynamic change of the wind speed returns the quantity of the power injected to networks. Therefore, wind–thermal generation scheduling problem plays a key role to implement clean power producers in a competitive environment. In deregulated power systems, the scheduling problem has various objectives than i...

T paper gives an overview of the theory and practice of planning and scheduling in supply chains. It first gives an overview of the various planning and scheduling models that have been studied in the literature, including lot sizing models and machine scheduling models. It subsequently categorizes the various industrial sectors in which planning and scheduling in the supply chains are importan...

In many basic scheduling models, jobs’ processing times and due-dates are deterministic. Practically, they are as uncertain variables in some more models. Furthermore, in a real situation of decision making, there exists uncertainty that can not be described only by fuzziness but also randomness. The purpose of this paper is to develop a methodology for parallel machines scheduling problem with...