Pages that link to "Item:Q1040975"

The following pages link to The distributed permutation flowshop scheduling problem (Q1040975):

Displaying 45 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
• MILP models for the optimization of real production lines (Q302141) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027) (← links)
• Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• Makespan distribution of permutation flowshop schedules (Q835630) (← links)
• Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
• A knowledge-based approach for multi-factory production systems (Q1652022) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints (Q1656191) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
• Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics (Q2002867) (← links)
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
• Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques (Q2256324) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
• The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine (Q2510555) (← links)
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem (Q2669577) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
• Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem (Q2688574) (← links)
• Survey on optimization algorithms for distributed shop scheduling (Q2994077) (← links)
• Collaborative Operating Room Planning and Scheduling (Q4599323) (← links)
• Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (Q5059417) (← links)
• Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition (Q5084654) (← links)
• Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints (Q5197293) (← links)
• Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
• Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
• Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
• Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
• Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups (Q6099438) (← links)
• The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)