Pages that link to "Item:Q4678194"
From MaRDI portal
The following pages link to A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194):
Displaying 10 items.
- Flow shop-sequencing problem with synchronous transfers and makespan minimization (Q5438669) (← links)
- Timed event graph-based cyclic reconfigurable flow shop modelling and optimization (Q5444453) (← links)
- On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
- Patients transportation in surgery scheduling problem (Q6595014) (← links)
