scientific article; zbMATH DE number 522730
From MaRDI portal
Publication:4284145
Recommendations
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
- On the Minimization of the Makespan Subject to Flowtime Optimality
- Flowshop-scheduling problems with makespan criterion: a review
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Special Cases With Set Up Considerations for n×3 Flowshop Problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Minimizing makespan in a three-stage flexible flowshop with identical machines and two batch processors
- Optimal scheduling of the 3-machine assembly-type flow shop
Cited in
(5)- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- On the optimality conditions of the two-machine flow shop problem
- A new sufficient condition of optimality for the two-machine flowshop problem
- Lower and upper bounds for the optimal makespan in the multimedia problem
- scientific article; zbMATH DE number 5052107 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284145)
