Pages that link to "Item:Q1929241"

The following pages link to Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241):

Displayed 2 items.

• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) ‎ (← links)
• A study of single-machine scheduling problem to maximize throughput (Q398860) ‎ (← links)