A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work
by Luk N. van Wassenhove
Part of Working papers / INSEAD -- no.91/41/TM
Discuss A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work with other readers
Join or start a book club for A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work?
Sign up free on Readfeed, then browse public clubs or start your own club with A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.