Pages that link to "Item:Q1194720"

The following pages link to An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720):

Displaying 45 items.

• 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)
• Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• A job shop scheduling heuristic for varying reward structures (Q815476) (← 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)
• Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• A new heuristic method for the flow shop sequencing problem (Q1119464) (← links)
• Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545) (← links)
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
• Optimal job scheduling for flowshops (Q1287338) (← links)
• A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
• Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
• A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189) (← links)
• Total flowtime in no-wait flowshops with separated setup times. (Q1406685) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
• Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
• Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
• Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
• Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• A modification to the CGPS algorithm for three-machine flow shop scheduling (Q2766119) (← links)
• A heuristic genetic algorithm for flowshop scheduling (Q2768214) (← links)
• A survey and evaluation of static flowshop scheduling heuristics (Q3329204) (← links)
• Heuristic algorithms for continuous flow-shop problem (Q3489781) (← links)
• Solving flexible flow-shop problems by LPT and LN scheduling algorithms (Q3517610) (← links)
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME (Q3982632) (← links)
• OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP (Q4366147) (← links)
• A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory (Q5392012) (← links)
• A fast method for heuristics in large-scale flow shop scheduling (Q5477256) (← links)
• An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems (Q5882416) (← links)
• A flexible flowshop problem with total flow time minimization (Q5939584) (← links)
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)