Pages that link to "Item:Q2387249"

The following pages link to Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249):

Displaying 20 items.

• Scheduling algorithms for real-time computing systems admitting simulation models (Q395267) (← links)
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises (Q492824) (← links)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints (Q1762015) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
• Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping (Q2669726) (← links)
• An effective scheduling method to single-arm cluster tools for processing multiple wafer types (Q2691392) (← links)
• Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines (Q3605446) (← links)
• Design of supply chain networks with multi-phased discount price and service level: formulation, complexity, and algorithm (Q3643080) (← links)
• Optimizing the production schedule of an agricultural cooperative: a case study (Q5059303) (← links)
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)