Active and Busy Time Scheduling Problem: A Survey

The scheduling is the process of the optimal resource allocation that is widely used both in everyday life and specific domains. In the paper the description of scheduling problem is given. The authors consider traditional methods and tools for solving this problem, then describe the proposed approach based on multi-agent technologies and multithreading application. Nowadays there exist numerous approaches to solving of the scheduling problem. In the most of cases this process has to be supported and managed by the complex tools, sometimes based on mathematical principles. The suggested method of multithreading multi-agent scheduling allows efficient and fast solution of complex problems in real-time featuring rapid dynamic changes and uncertainty that cannot be handled by the other methods and tools.

Download Full-text

Distributed Feedback Mechanism for Just-In-Time Scheduling Problem

2009 Eighth IEEE/ACIS International Conference on Computer and Information Science ◽

10.1109/icis.2009.12 ◽

2009 ◽

Cited By ~ 1

Author(s):

Wei Weng ◽

Shigeru Fujimura

Keyword(s):

Feedback Mechanism ◽

Distributed Feedback ◽

Just In Time ◽

Scheduling Problem ◽

Time Scheduling

Download Full-text

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Discrete Dynamics in Nature and Society ◽

10.1155/2015/350308 ◽

2015 ◽

Vol 2015 ◽

pp. 1-12 ◽

Cited By ~ 2

Author(s):

Sivashan Chetty ◽

Aderemi O. Adewumi

Keyword(s):

Local Search ◽

Current Problem ◽

Initial Study ◽

Just In Time ◽

Scheduling Problem ◽

Metaheuristic Algorithm ◽

Scheduling Problems ◽

Specific Point ◽

Time Scheduling ◽

Problem Setting

The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA), is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS) and Simulated Annealing (SA). SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

Download Full-text