Minimizing makespan in parallel flowshops
From MaRDI portal
Recommendations
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Makespan minimization subject to flowtime optimality on identical parallel machines
- Minimizing makespan in hybrid flowshops
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- On the Minimization of the Makespan Subject to Flowtime Optimality
- Minimizing flowtime subject to optimal makespan on two identical parallel machines
- Concurrent flowshop scheduling to minimize makespan.
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Minimizing makespan in a pallet-constrained flowshop
Cited in
(12)- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Concurrent flowshop scheduling to minimize makespan.
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Makespan minimization subject to flowtime optimality on identical parallel machines
- The hybrid flow shop scheduling problem
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
- Makespan minimization for parallel jobs with energy constraint
- Scheduling multi-stage parallel-processor services to minimize average response time
- Minimizing makespan and throughput times at Aalsmeer flower auction
- Minimizing flowtime subject to optimal makespan on two identical parallel machines
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
This page was built for publication: Minimizing makespan in parallel flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356676)
