Pages that link to "Item:Q1338896"

The following pages link to Heuristics for parallel machine scheduling with delivery times (Q1338896):

Displaying 19 items.

• Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
• Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
• Scheduling installations in the telecommunications industry (Q1291579) (← links)
• Parallel machine scheduling with batch delivery to two customers (Q1665075) (← links)
• Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
• Machine scheduling with job delivery coordination (Q1876146) (← links)
• Coordinating multi-location production and customer delivery (Q1936790) (← links)
• Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
• Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
• Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
• Machine scheduling with transportation considerations (Q5932281) (← links)
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
• An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)