Pages that link to "Item:Q4171849"

The following pages link to AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM (Q4171849):

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 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)
• An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← 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)
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← 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)
• A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← 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)