Pages that link to "Item:Q2566710"

The following pages link to A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710):

Displaying 20 items.

• Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics (Q324324) (← links)
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• Multi-directional local search (Q339654) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
• A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
• Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints (Q1656191) (← links)
• Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms (Q2218447) (← links)
• Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
• Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
• A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
• A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698) (← links)
• (Q5154491) (← links)
• A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q5431617) (← links)