Pages that link to "Item:Q2572852"

The following pages link to A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852):

Displaying 47 items.

• Machine scheduling in underground mining: an application in the potash industry (Q280169) (← links)
• Multi-stage stochastic mean-semivariance-CVaR portfolio optimization under transaction costs (Q299658) (← links)
• A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
• An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling (Q322540) (← links)
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
• Statistical design of genetic algorithms for combinatorial optimization problems (Q410570) (← links)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
• Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines (Q962838) (← links)
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry (Q992661) (← links)
• Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells (Q1652519) (← links)
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
• A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q2217032) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• A hybrid method for large-scale short-term scheduling of make-and-pack production processes (Q2356282) (← 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)
• A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption (Q2656739) (← links)
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant (Q2664430) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678) (← links)
• An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns (Q3055224) (← links)
• Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
• Scheduling semiconductor in-line steppers in new product/process introduction scenarios (Q3163705) (← links)
• A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD (Q3406729) (← links)
• Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines (Q3605446) (← links)
• A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines (Q4634331) (← links)
• Scheduling of multiple in-line steppers for semiconductor wafer fabs (Q5172568) (← links)
• Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
• An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model (Q6065602) (← links)
• Dispatching problems for parallel machines in the TFT‐LCD assembly process (Q6092611) (← links)
• A hybrid genetic algorithm based on reinforcement learning for the energy-aware production scheduling in the photovoltaic glass industry (Q6551123) (← links)