Pages that link to "Item:Q1296581"

The following pages link to A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581):

Displayed 7 items.

• Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) ‎ (← links)
• The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) ‎ (← links)
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) ‎ (← links)
• The routing open-shop problem on a network: complexity and approximation (Q2496075) ‎ (← links)
• On-line two-machine open shop scheduling with time lags (Q2654315) ‎ (← links)
• Transporting jobs through a two‐machine open shop (Q3621908) ‎ (← links)
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays (Q5443372) ‎ (← links)