scholarly journals Heuristics and stochastic local search for just-in-time scheduling of parallel machines against common restrictive due windows

2020 ◽  
Author(s):  
Gustavo Alencar Rolim
Keyword(s):  
Local Search ◽  
Parallel Machines ◽  
Just In Time ◽  
Stochastic Local Search ◽  
Time Scheduling ◽  
Due Windows

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.

A search heuristic for just-in-time scheduling in parallel machines

1991 ◽  
Vol 2 (4) ◽  
pp. 253-260 ◽  
Author(s):  
Manuel Laguna ◽  
Jos� Luis Gonz�lez Velarde
Keyword(s):  
Parallel Machines ◽  
Just In Time ◽  
Search Heuristic ◽  
Time Scheduling

Just-in-time scheduling with controllable processing times on parallel machines

2009 ◽  
Vol 19 (3) ◽  
pp. 347-368 ◽  
Author(s):  
Yaron Leyvand ◽  
Dvir Shabtay ◽  
George Steiner ◽  
Liron Yedidsion
Keyword(s):  
Parallel Machines ◽  
Just In Time ◽  
Controllable Processing Times ◽  
Processing Times ◽  
Time Scheduling

Just-in-time scheduling with two competing agents on unrelated parallel machines

Omega ◽  
2016 ◽  
Vol 63 ◽  
pp. 41-47 ◽  
Author(s):  
Yunqiang Yin ◽  
Shuenn-Ren Cheng ◽  
T.C.E. Cheng ◽  
Du-Juan Wang ◽  
Chin-Chia Wu
Keyword(s):  
Parallel Machines ◽  
Just In Time ◽  
Unrelated Parallel Machines ◽  
Time Scheduling
Sign in / Sign up

Export Citation Format

Share Document