Pages that link to "Item:Q1197966"
From MaRDI portal
The following pages link to A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966):
Displayed 24 items.
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← links)
- Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations (Q1717811) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines (Q2456642) (← links)
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
- Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic (Q3055403) (← links)
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)
- Steel-making process scheduling using Lagrangian relaxation (Q4443361) (← links)
- A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines (Q4634331) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop (Q5466727) (← links)
- Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
- A flexible flowshop problem with total flow time minimization (Q5939584) (← links)
- Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203) (← links)
- An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model (Q6065602) (← links)