Pages that link to "Item:Q2757667"

The following pages link to A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (Q2757667):

Displaying 17 items.

• Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
• Optimal packet-to-slot assignment in mobile telecommunications (Q833596) (← links)
• Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
• On the bin packing problem with a fixed number of object weights (Q872247) (← links)
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
• More on online bin packing with two item sizes (Q955329) (← links)
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
• Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
• Carathéodory bounds for integer cones (Q2480055) (← links)
• Packet scheduling in third-generation mobile systems with UTRA-TDD air interface (Q2480204) (← links)
• A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
• An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
• (Q5089171) (← links)
• Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)