Improved disjunctive programming approach with Tabu search algorithm in shop scheduling problem

Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impa...

Full description

Saved in:
Bibliographic Details
Main Authors: Nordin, S. Z., Saipol, H. F. S., Johar, F.
Format: Conference Proceeding
Language:English
Subjects:
Heuristic methods
Job shop scheduling
Manufacturing
Productivity
Profitability
Programming
Search algorithms
Tabu search
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0192114