Pages that link to "Item:Q1278545"
From MaRDI portal
The following pages link to Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545):
Displaying 14 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)
- 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 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)
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan (Q2369202) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← 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)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
