1FarZ1/DL-Based-Permutation-Flowshop-Problem

My Solution to the FlowShop Problem in CSE DataHack

13
/ 100
Experimental

This project helps operations managers and production planners optimize manufacturing schedules. It takes in details about production jobs and available machines, and outputs the most efficient sequence for these jobs, aiming to minimize the total time it takes to complete all tasks. Production planners who need to quickly generate optimal schedules for complex factory environments would find this useful.

No commits in the last 6 months.

Use this if you need to rapidly find the best possible sequence for jobs across multiple machines to reduce overall production time in a factory or workshop setting.

Not ideal if your scheduling problem involves real-time dynamic changes, complex resource constraints beyond machines, or human resource allocation.

production-scheduling operations-management manufacturing-optimization supply-chain-logistics industrial-engineering
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 5 / 25
Maturity 8 / 25
Community 0 / 25

How are scores calculated?

Stars

13

Forks

Language

Jupyter Notebook

License

Last pushed

Feb 24, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/1FarZ1/DL-Based-Permutation-Flowshop-Problem"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.