Skip to main content
MathDB
Sign in
Home
News
Database
Papers
Forum
Tags
Graph
People
Badges
API
Notifications
Chats
Bookmarks
About
Discord
Feature request
Report a bug
1 problem
Trending
Newest
Featured
Likes
Filters
1
Post Problem
Matching
Tag: flowshop-scheduling
Taillard's asymptotic tightness conjecture for permutation flowshop lower bounds
1 year old
Taillard's conjecture. For a fixed number of machines
M
M
M
,