Pages that link to "Item:Q1129912"
From MaRDI portal
The following pages link to Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912):
Displayed 18 items.
- Two-machine flow shop problems with a single server (Q880567) (← 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)
- 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)
- A comparative study of dispatching rules in dynamic flowshops and jobshops (Q1610138) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
- Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing (Q5466739) (← links)
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← links)