Pages that link to "Item:Q1374441"

The following pages link to An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441):

Displaying 50 items.

• List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
• An integrated search heuristic for large-scale flexible job shop scheduling problems (Q336652) (← links)
• Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← links)
• Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
• Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems (Q440881) (← links)
• Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
• Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
• Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
• Flexible job shop scheduling with overlapping in operations (Q965603) (← links)
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← links)
• Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem (Q1042492) (← links)
• Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
• Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
• Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
• A hierarchical approach for the FMS scheduling problem (Q1390190) (← links)
• Job-shop scheduling with processing alternatives. (Q1410614) (← links)
• Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
• Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
• Tabu search for resource-constrained scheduling (Q1609891) (← links)
• A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
• Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
• A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
• Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
• A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem (Q1992548) (← links)
• An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
• Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
• A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
• A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
• Theorem proving for pointwise metric temporal logic over the naturals via translations (Q2228435) (← links)
• Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
• A sequencing approach for creating new train timetables (Q2267382) (← links)
• A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
• Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times (Q2428941) (← links)
• A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
• A genetic algorithm for the flexible job-shop scheduling problem (Q2482369) (← links)
• A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)