Pages that link to "Item:Q1580980"

The following pages link to Scheduling a flowline manufacturing cell with sequence dependent family setup times (Q1580980):

Displaying 33 items.

• New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
• Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
• Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
• A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times (Q709158) (← links)
• Total flow time minimization in a flowshop sequence-dependent group scheduling problem (Q733546) (← links)
• Process planning for circuit card assembly on a series of dual head placement machines (Q881525) (← links)
• Scheduling jobs families with learning effect on the setup (Q888283) (← links)
• Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times (Q958443) (← links)
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates (Q1630186) (← links)
• A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
• A performance comparison and evaluation of metaheuristics for a batch scheduling problem in a multi-hybrid cell manufacturing system with skilled workforce assignment (Q1717033) (← links)
• A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem (Q1736622) (← links)
• Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• A scheduling problem in the baking industry (Q2336885) (← links)
• Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem (Q2341222) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) (Q2676023) (← links)
• Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times (Q3002327) (← links)
• Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times (Q3055422) (← links)
• Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups (Q3163328) (← links)
• Set-up games: a heuristic game-theoretic approach to set-up decisions for heterarchical manufacturing systems (Q4671316) (← links)
• A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem (Q5172421) (← links)
• Scheduling in cellular manufacturing systems: an heuristic approach (Q5444621) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
• Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
• Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints (Q6109801) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)