Pages that link to "Item:Q5621253"

The following pages link to An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques (Q5621253):

Displaying 45 items.

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
• An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
• An exact method for scheduling of the alternative technologies in R\&D projects (Q339595) (← links)
• Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem (Q415556) (← links)
• On a learning precedence graph concept for the automotive industry (Q439367) (← links)
• A classification of predictive-reactive project scheduling procedures (Q835548) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
• A random generator of resource-constrained multi-project network problems (Q964864) (← links)
• Balancing modular transfer lines with serial-parallel activation of spindle heads at stations (Q1003756) (← links)
• Models for concurrent product and process design (Q1046061) (← links)
• Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
• On methods for generating random partial orders (Q1085055) (← links)
• On the measurement of complexity in activity networks (Q1145062) (← links)
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
• Designing paced assembly lines with fixed number of stations (Q1291625) (← links)
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← links)
• Progress payments in project scheduling problems. (Q1812008) (← links)
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders (Q1820992) (← links)
• Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems (Q1821677) (← links)
• U-shaped assembly line layouts and their impact on labor productivity: an experimental study (Q1877912) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Resource-constrained project scheduling with activity splitting and setup times (Q2003582) (← links)
• The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds (Q2215556) (← links)
• Negotiation mechanisms for the multi-agent multi-mode resource investment problem (Q2239866) (← links)
• An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
• An evaluation of the adequacy of project network generators with systematically sampled networks (Q2463502) (← links)
• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
• Balancing assembly lines with tabu search (Q2569069) (← links)
• An analysis of network and resource indicators for resource-constrained project scheduling problem instances (Q2668709) (← links)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows (Q3163363) (← links)
• An efficient heuristic method for the simple assembly line balancing problem (Q3707758) (← links)
• A branch‐and‐bound algorithm for scheduling of new product development projects (Q4921224) (← links)
• A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure (Q5270510) (← links)
• Profit-oriented disassembly-line balancing (Q5385502) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem (Q6106485) (← links)
• A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem (Q6106590) (← links)
• New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms (Q6164372) (← links)
• Reducing the feasible solution space of resource-constrained project instances (Q6561212) (← links)
• Analysis of the impact of corrective actions for stochastic project networks (Q6565390) (← links)
• On the summary measures for the resource-constrained project scheduling problem (Q6581387) (← links)