Pages that link to "Item:Q596453"

The following pages link to Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453):

Displayed 21 items.

• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) ‎ (← links)
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) ‎ (← links)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) ‎ (← links)
• Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) ‎ (← links)
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) ‎ (← links)
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) ‎ (← links)
• Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) ‎ (← links)
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) ‎ (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) ‎ (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) ‎ (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) ‎ (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) ‎ (← links)
• Scheduling parallel batching machines in a sequence (Q2283298) ‎ (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) ‎ (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) ‎ (← links)
• Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) ‎ (← links)
• Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596) ‎ (← links)
• Transporting jobs through a two‐machine open shop (Q3621908) ‎ (← links)
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) ‎ (← links)
• On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) ‎ (← links)
• On the complexity of open shop scheduling with time lags (Q6173710) ‎ (← links)