Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/rpifisherman/aps-app
A self-made demo for Advance Scheduling using branch and bound method
https://github.com/rpifisherman/aps-app
aps apscheduler branch-and-bound heuristic-algorithm heuristic-search-algorithms internship-task javafx
Last synced: 20 days ago
JSON representation
A self-made demo for Advance Scheduling using branch and bound method
- Host: GitHub
- URL: https://github.com/rpifisherman/aps-app
- Owner: RPIFisherman
- License: mit
- Archived: true
- Created: 2024-07-04T05:09:31.000Z (8 months ago)
- Default Branch: master
- Last Pushed: 2024-08-02T09:29:41.000Z (7 months ago)
- Last Synced: 2024-10-14T19:21:17.997Z (4 months ago)
- Topics: aps, apscheduler, branch-and-bound, heuristic-algorithm, heuristic-search-algorithms, internship-task, javafx
- Language: Java
- Homepage:
- Size: 1.45 MB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Advanced Planning and Scheduling(APS) Application
[](https://rpifisherman.github.io/APS-app/javadocs/index.html)
[](https://rpifisherman.github.io/APS-app/javadocs/ygong/APS/package-summary.html)
[](README_CN.md)
```text
_ _ _ _ _ _
/ /\ /\ \ / /\ / /\ /\ \ /\ \
/ / \ / \ \ / / \ / / \ / \ \ / \ \
/ / /\ \ / /\ \ \ / / /\ \__ / / /\ \ / /\ \ \ / /\ \ \
/ / /\ \ \ / / /\ \_\ / / /\ \___\ / / /\ \ \ / / /\ \_\ / / /\ \_\
/ / / \ \ \ / / /_/ / / \ \ \ \/___/ / / / \ \ \ / / /_/ / // / /_/ / /
/ / /___/ /\ \ / / /__\/ / \ \ \ / / /___/ /\ \ / / /__\/ // / /__\/ /
/ / /_____/ /\ \ / / /_____/_ \ \ \ / / /_____/ /\ \ / / /_____// / /_____/
/ /_________/\ \ \ / / / /_/\__/ / / / /_________/\ \ \ / / / / / /
/ / /_ __\ \_\/ / / \ \/___/ / / / /_ __\ \_\/ / / / / /
\_\___\ /____/_/\/_/ \_____\/ \_\___\ /____/_/\/_/ \/_/
```
## Introduction
Extend from the [APS-MES](https://github.com/RPIFisherman/APS-MES). This project
add a graphical user interface (GUI) to the APS application. The GUI is
implemented using the [javafx](https://openjfx.io/) library.
[](https://github.com/RPIFisherman/APS-app/actions/workflows/qodana_code_quality.yml)
[](https://github.com/RPIFisherman/APS-app/actions/workflows/auto_sync.yml)
[](https://codecov.io/gh/RPIFisherman/APS-app)
Thanks
to [Roland's Gantt Plot code](https://stackoverflow.com/questions/27975898/gantt-chart-from-scratch),
which helps me a lot on JavaFX.
## Requirements
- Java 21 is recommended, other version may not work.
- Java 8 can compile and run [APSDemo.java](src/main/java/APSDemo.java) but
may not pass the test.
- Maven 3.9.6 is recommended, other version may not work.
## APSDemo:
## APSDemo Output:
## Project Structure:
### Concise Diagram:
```mermaid
classDiagram
class Schedule {
-ArrayList~MachineWithOrders~ _machines
-Grade _grade
+void calcStat(double min_makespan, int num_orders)
+Grade calcGradeByWeights(int on_time_weight, int makespan_weight, int est_weight, int ldt_weight)
+void scheduleAllOrders(Scheduler scheduler)
}
class Schedule_MachineWithOrders {
-Machine machine
-ArrayList~OrderWithTime~ orders
-double _approx_run_time
+boolean addOrder(Order o)
+boolean removeOrder(Order o)
+void scheduleAllOrders(Scheduler scheduler)
+void scheduleAllOrders()
}
class Schedule_OrderWithTime {
-Order order
-int _start_time
-int _end_time
-int status
+void setStartEndTime(int start_time, int end_time)
}
class Schedule_Grade {
-double on_time_percentage
-double makespan_percentage
-double est_percentage
-double ldt_percentage
-double grade
+void calcGradeByWeights(int on_time_weight, int makespan_weight, int est_weight, int ldt_weight)
}
class Machine {
+String name
+int machine_ID
-HashMap~Integer, Integer~ products_pace_per_hour
+boolean checkViableOrder(int production_type_ID)
+int getProductionPace(int production_type_id)
}
class Order {
+String name
+int order_ID
+int earliest_start_time
+int delivery_time
+int latest_due_time
+int quantity
+int production_type_ID
}
class Rules {
+static boolean belowCapacity(MachineWithOrders machine, double threshold)
+static boolean aboveCapacity(MachineWithOrders machine, double threshold)
+static boolean orderFitsMachine(MachineWithOrders machine, OrderWithTime order)
}
class Scheduler {
-List~Schedule~ _schedules
-ExecutorService _executor
-int _num_production_types
-int _num_machines
-int _num_orders
-int _max_hours_allowed
-double _max_capacity_per_machine
-double _min_capacity_per_machine
-double _min_makespan
-ArrayList~ArrayList~Double~~ _order_type_switch_times
-ArrayList~Order~ _orders
-ArrayList~Machine~ _machines
+void generateAllPossible()
+void calcAllSchedulesGrade(Integer... weights)
}
Schedule "1" *-- "many" Schedule_MachineWithOrders: Contains many machines
Schedule_MachineWithOrders "1" *-- "many" Schedule_OrderWithTime: Contains many orders
Schedule_OrderWithTime "1" *-- "1" Order: refers to one order
Schedule_MachineWithOrders "1" *-- "1" Machine: refers to one machine
Schedule "1" *-- "1" Schedule_Grade: has one grade
Scheduler "1" *-- "1" Rules: can apply many rules
Scheduler "1" *-- "many" Schedule: has many schedules
```
## Project Workflow:
```mermaid
graph TD
A[Start] --> init["init()
All the Machines with production pace per hour
All the Orders with earliest start time, delivery time,
latest due time, quantity, production type
Rules (belowCapacity, aboveCapacity, orderFitsMachine)
Switch Matrix"]
subgraph "Input"
init
rules["Hard Requirements"]
F[weights for grade]
end
subgraph "generateAllSchedules()"
init --> depthFirstSearch{"Recursion with Constrains
depthFirstSearch()"}
rules --> depthFirstSearch{"Recursion with Constrains
depthFirstSearch()"}
depthFirstSearch -->|Satisfied| C["Add to schedules"]
%%depthFirstSearch -->|Unsatisfied|depthFirstSearch
C --> D["Call scheduleAllOrders()"]
end
D --> E[Output Schedules]
F --> calcStat["Call calcStat()"]
E --> calcStat
subgraph "Call calcAllSchedulesGrade()"
subgraph "forEach schedules"
calcStat --> calcGradeByWeights["Call calcGradeByWeights()"]
calcGradeByWeights --> Grade[Grade]
end
Grade --> sort[Sort by Grade]
end
sort --> G[Output Schedule with Grade is descending order]
G --> H[Generate Plot etc.]
```