Pages that link to "Item:Q2270289"

The following pages link to The hybrid flow shop scheduling problem (Q2270289):

Displaying 39 items.

• A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
• An approach for bi-objective maintenance scheduling on a networked system with limited resources (Q2083933) (← links)
• Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag (Q2108105) (← links)
• Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs (Q2115759) (← links)
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel (Q2184047) (← links)
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing (Q2283857) (← links)
• Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
• Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty (Q2294752) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study (Q2337384) (← links)
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages (Q2356251) (← links)
• A data intensive heuristic approach to the two-stage streaming scheduling problem (Q2402350) (← links)
• Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• Flexible job shop scheduling with blockages (Q2454071) (← links)
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search (Q2664365) (← links)
• Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization (Q2664442) (← links)
• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem (Q2669577) (← links)
• Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities (Q2669630) (← 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)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (Q5059417) (← links)
• Method of rescheduling for hybrid production lines with intermediate buffers (Q5150030) (← links)
• A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect (Q6043106) (← links)
• A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)
• Hybrid variable neighborhood search for automated warehouse scheduling (Q6063514) (← links)
• Modeling and solving the steelmaking and casting scheduling problem (Q6066683) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)
• A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)