Pages that link to "Item:Q4545699"

The following pages link to A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems (Q4545699):

Displaying 18 items.

• Routing open shop and flow shop scheduling problems (Q421573) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← 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)
• Optimal collection of medical specimens and delivery to central laboratory (Q2178326) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Decision making algorithm for a class of two‐level manufacturing systems (Q3451519) (← links)
• Transporting jobs through a two‐machine open shop (Q3621908) (← links)
• Worst‐case allocation algorithms in a complex of operations with interval parameters (Q3639401) (← links)
• Routing Two-Machine Flowshop Problems on Networks with Special Structure (Q4346443) (← links)
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
• O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
• Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
• Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
• An exact solution with an improved running time for the routing flow shop problem with two machines (Q6620464) (← links)