Pages that link to "Item:Q1652188"
From MaRDI portal
The following pages link to Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188):
Displaying 11 items.
- Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production (Q2293881) (← links)
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
- A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
- The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486) (← links)
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time (Q6593195) (← links)
