File:CompOp Wiki.png: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
No edit summary
 
(No difference)

Latest revision as of 23:31, 28 November 2021

Branch and Bound method used to solve a simple job-shop scheduling problem coordinating 3 jobs requiring shared use of 1 machine to complete. Each job has a different deadline, and the goal is to minimize total delay in the project.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current23:31, 28 November 2021Thumbnail for version as of 23:31, 28 November 20211,066 × 411 (58 KB)Ms3693 (talk | contribs)

There are no pages that use this file.

Metadata