Pages that link to "Item:Q421573"

The following pages link to Routing open shop and flow shop scheduling problems (Q421573):

Displaying 17 items.

• A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector (Q490386) (← links)
• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
• Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453) (← links)
• Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
• (Q3402497) (← links)
• The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← links)
• Routing Two-Machine Flowshop Problems on Networks with Special Structure (Q4346443) (← links)
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems (Q4545699) (← links)
• Scheduling Problems over Network of Machines (Q5002605) (← links)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• A review on integrated scheduling and outbound vehicle routing problems (Q6168583) (← 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)