Pages that link to "Item:Q4393117"

The following pages link to Minimizing Makespan in a Class of Reentrant Shops (Q4393117):

Displaying 25 items.

• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop (Q602916) (← links)
• Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
• On the connection between a cyclic job shop and a reentrant flow shop scheduling problem (Q880555) (← links)
• Heuristic algorithms for two machine re-entrant flow shop (Q930923) (← links)
• Scheduling reentrant jobs on parallel machines with a remote server (Q1010265) (← links)
• Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• The complexity of cyclic shop scheduling problems (Q1607980) (← links)
• Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← 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)
• Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
• Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm (Q2298225) (← links)
• Multi-family scheduling in a two-machine reentrant flow shop with setups (Q2467261) (← links)
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem (Q2485171) (← links)
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
• Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times (Q3430247) (← links)
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop (Q5466727) (← links)
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)