Scheduling problems, e.g., a job-shop scheduling, are classical NP-hard problems. In the paper a two-level adaptation method is proposed to solve the scheduling problem in a dynamically changing and uncertain environment. It is applied to the heterarchical multi-agent architecture developed by Valckenaers et al. Their work is improved by applying machine learning techniques, such as: neurodynam...

This paper develops and analyzes several customer order acceptance policies to achieve high bottleneck utilization for the customized stochastic lot scheduling problem (CSLSP) with large setups and strict order due dates. To compare the policies simulation is used as main tool, due to the complicated nature of the problem. Also approximate upper and lower bound for the utilization are provided....

Dealing with scheduling problems leads to the need of task models representing their activation, execution and termination characteristics. During the last 20 years a lot of research has been done on scheduling of real-time systems and a huge number of real-time scheduling algorithms were proposed. In this paper we present a summary of the task constraints handled by the existing algorithms. Un...

Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a task graph on a multiprocessor, called the parallelizable dependent task scheduling problem. Associated with each task, we are given the time it takes to run...

The anticipation of a large penetration of EVs (electric vehicles) into the market brings up many technical issues. The power system may put at risk the security and reliability of operation due to uncontrolled EV charging and discharging. It is necessary to carry out intelligent scheduling for charging and discharging of EVs. In this paper, a smart management and scheduling model is proposed f...

This paper introduces an evolutionary algorithm as a procedure to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). This problem can be found in some industrial settings, mainly soft drink companies, where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to...

This paper calls for a change in paradigm in lot sizing and scheduling. Traditionally, a discrete time scale is chosen to model lot sizing and scheduling. As an alternative, the so-called block planning concept is proposed which is based on a continuous representation of time. A mixed-integer linear optimization model is presented that determines the size and the time phasing of the individual ...

Scheduling problems are found in a lot of application domains. Well known is the scheduling of production where manufacturing operations have to be assigned to limited resources like machines, but also other applications are important, e.g., the scheduling of airline crews, space missions, projects in different domains, clinical surgery, even timetabling and processor scheduling include schedul...