Search Results

Conventional parking lots struggle to meet demand, prompting the rise of Fully Automated Parking Systems (FAPS), offering eco-friendly alternatives with advanced technology. However, operational challenges persist, especially in planning and scheduling. ...

Recent years saw an increase in the application of genetic programming (GP) as a hyper-heuristic, i.e., a method used to generate heuristics for solving various combinatorial optimisation problems. One of its widest application is in scheduling to ...

Dynamic multi-objective (MO) scheduling problems are encountered in various real-world situations. Due to dynamic events that occur in such problems, one has to resort to using simple constructive heuristics, called dispatching rules (DRs), when ...

Dynamic scheduling problems are important optimisation problems with many real-world applications. Since in dynamic scheduling not all information is available at the start, such problems are usually solved by dispatching rules (DRs), which create the ...

Finding optimized machine schedules is a very important task that arises in many areas of industrial manufacturing. In practice dispatching rules are often used to create schedules within short run times. This paper investigates a method for automated ...

The manufacturing systems which produce the parts of aircraft engines are usually classified into the order-made systems with highly variety and small quantity. Thus, many of factories have applied typical hybrid job shop system. However, the layout ...

The paper presents a new modeling framework enabling to evaluate the cyclic steady state of a given system of concurrently flowing cyclic processes (SCCP) sharing common system resources while interacting on the base of a mutual exclusion ...

Decentralized scheduling with dispatching rules is applied in many fields of logistics and production, especially in semiconductor manufacturing, which is characterized by high complexity and dynamics. Many dispatching rules have been found, which ...

In this paper, a genetic programming based data mining approach is proposed to select dispatching rules which will result in competitive shop performance under a given set of shop parameters (e.g. interarrival times, pre-shop pool length). The main ...

Developing dispatching rules for manufacturing systems is a process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and objectives automatic rule search mechanism are investigated. In this paper an ...

The factory space for assembly is one of critical resources for the machine assembly industry. In the past, many researches discussed job shop or single machine scheduling problems with time constraint. In machinery, factory space constrains scheduling. ...

This paper addresses on solving a well known Non Polynomial (NP) hard type problem, namely the single machine total weighted-tardiness problem. The performances of three hybrid heuristic algorithms to solve the single machine scheduling problems with ...

This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able to deal with common problems of the job scheduling in Grids like ...

This paper introduces a novel methodology for generating scheduling rules using a data-driven approach. We show how to use data mining to discover previously unknown dispatching rules by applying the learning algorithms directly to production data. This ...

The problem of scheduling in dynamic conventional jobshops has been extensively investigated over many years. However, the problem of scheduling in assembly jobshops (i.e. shops that manufacture multi-level jobs with components and subassemblies) has ...