Skip to content

The goal of the JobSequencing problem is as follows. Given workers and jobs, where each job has a designated length, assign each of the jobs to one of the workers such that largest total length assigned to a worker is minimized

Notifications You must be signed in to change notification settings

DynexMarketplace/job_sequencing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Dynex SDK Template

Dynex is the world’s only accessible neuromorphic quantum computing cloud for solving real-world problems, at scale.

Usage

  1. Launch in Github Codespaces and wait until the codepsace is fully initialised

  2. Add your account keys by drag&drop of your dynex.ini into the main folder

  3. Run the demo by opening the Jupyter notebook file *.ipynb

About

The goal of the JobSequencing problem is as follows. Given workers and jobs, where each job has a designated length, assign each of the jobs to one of the workers such that largest total length assigned to a worker is minimized

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published