maxkratz/flowshop-scheduling
1
0
Fork 0
mirror of https://github.com/maxkratz/flowshop-scheduling.git synced 2024-05-20 20:00:38 +00:00
Code Issues Packages Projects Releases Wiki Activity
Eclipse project for solving a flowshop-scheduling problem with the algorithm of Nawaz, Enscore and Ham (NEH algorithm)
12 commits 1 branch 0 tags 53 KiB
HTML 77.4%
CSS 11.4%
Java 10.5%
JavaScript 0.7%
Go to file
Maximilian Kratz 2c171c87a7 Added .gitattributes for correct linguist settings
2017-11-13 16:54:36 +01:00
flowshop-scheduling Formatted the code with google-codestyle 2017-11-13 16:33:55 +01:00
.gitattributes Added .gitattributes for correct linguist settings 2017-11-13 16:54:36 +01:00
README.md Added some more information 2017-11-13 16:27:31 +01:00

README.md

Flowshop-Scheduling

Java-project for solving a flowshop-scheduling problem (FSP) based on the algorithm of Nawaz, Enscore and Ham (NEH). Click here to learn more about this algorithm: NEH algorithm

Features

  • Written in Java using eclipse as IDE
  • Easy to use with integer values

Installation

  • Clone the repository to your local workspace and import the project with eclipse
  • No other libs or packages required

How to run

  • See example in Main.java
    • Create an object of NEH.java
    • Create an (empty) arraylist of int-arrays
    • Create an int-array (containing the information of each runtime) for each job or read the job-times from a textdocument
    • Add the job-arrays to the arraylist
    • run the calculateNEHOrder(joblist) method to calculate the Order of the NEH algorithm
    • run the calculateNTotalMakespan(results) method to calculate the total makespan of the joblist
  • There is a folder with the java doc :-)