Pages that link to "Item:Q732880"

The following pages link to Algorithms for a realistic variant of flowshop scheduling (Q732880):

Displaying 18 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation (Q1998264) (← links)
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant (Q2664430) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• (Q3820362) (← links)
• Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
• Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
• An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
• Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)