/Sequencing-NP-HARD-Op-Research

Algorithm that finds optimized solution even when sequencing fails over the non binary search tree pattern.

Primary LanguagePython

Sequencing-NP-HARD-Op-Research

Abstract:

Job Sequencing problems are often tackled on the basis of 1 unit time as per job which is not possible in real life.Here we present a improved method to optimize the Job Sequencing equivalent or better than Johnson's Method of Job Sequencing with variable job quantity as well as Non Binary Search Tree Conditions of Job Time while efficiently reducing total elapsed time of machines The effectiveness of the sequencing problem can be measured in terms of minimized costs, maximized profits, minimized elapsed time and meeting due dates etc.

Explanation:

Machines ↓ Jobs → J1 J2 J3 J4 .. .. Jn-1 Jn
M1 x11 x12 x13 x14 .. .. x1n-1 x1n
M2 x21 x22 x23 x24 .. .. x2n-1 x2n
M3 x31 x22 x32 x41 .. .. x3n-1 x2n
M4 x41 x22 x32 x41 .. .. x4n-1 x2n
.. .. .. .. .. .. .. .. ..
.. .. .. .. .. .. .. .. ..
Mn-1 x61 x22 x32 x41 .. .. xn-1n-1 x2n
Mn x21 x22 x32 x41 .. .. xnn-1 xnn

Area