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

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
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.

Single machine Just-in-Time scheduling problems

2002 ◽  
pp. 119-145
Author(s):  
Vincent T’kindt ◽  
Jean-Charles Billaut
Keyword(s):  
Single Machine ◽  
Just In Time ◽  
Scheduling Problems ◽  
Time Scheduling

A New Neighborhood for the Job Shop Scheduling Problem

2012 ◽  
Vol 433-440 ◽  
pp. 1540-1544
Author(s):  
Mohammad Mahdi Nasiri ◽  
Farhad Kianfar
Keyword(s):  
Local Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithms ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Local Search Algorithms ◽  
Shop Scheduling ◽  
Neighborhood Structures

The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts.

scholarly journals Mixed Graph Colorings: A Historical Review

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 385 ◽  
Author(s):  
Yuri N. Sotskov
Keyword(s):  
Historical Review ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Graph Colorings ◽  
Mixed Graph ◽  
Criterion A ◽  
Complexity Results ◽  
Recent Developments ◽  
Time Scheduling ◽  
Makespan Criterion

This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices of the mixed graph and one coloring of the arcs and edges of the mixed graph have been considered in the literature. The unit-time scheduling problem with the makespan criterion may be interpreted as an optimal coloring of the vertices of a mixed graph, where the number of used colors is minimum. Complexity results for optimal colorings of the mixed graph are systematized. The published algorithms for finding optimal mixed graph colorings are briefly surveyed. Two new colorings of a mixed graph are introduced.

Sign in / Sign up

Export Citation Format

Share Document