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 17 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)
• 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 bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← 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)
• A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← 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)
• 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)
• 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)