Pages that link to "Item:Q5946533"

The following pages link to Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533):

Displaying 38 items.

• Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
• Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
• A note on the total completion time problem in a permutation flowshop with a learning effect (Q948678) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
• A genetic algorithm for flowshop scheduling with multiple objectives (Q1018947) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. (Q1399596) (← links)
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
• Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines (Q2242193) (← links)
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
• A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
• Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)