Pages that link to "Item:Q2706190"

The following pages link to Better Approximation Guarantees for Job-Shop Scheduling (Q2706190):

Displaying 8 items.

• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• High-multiplicity cyclic job shop scheduling (Q957353) (← links)
• Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
• Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
• Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)