Pages that link to "Item:Q733546"
From MaRDI portal
The following pages link to Total flow time minimization in a flowshop sequence-dependent group scheduling problem (Q733546):
Displaying 11 items.
- New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Scheduling jobs families with learning effect on the setup (Q888283) (← links)
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates (Q1630186) (← links)
- A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem (Q1736622) (← links)
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem (Q2341222) (← links)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints (Q6109801) (← links)
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
