Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of j
From MaRDI portal
Publication:3394089
Recommendations
- Minimizing total tardiness in permutation flowshops
- scientific article; zbMATH DE number 811323
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem
- scientific article; zbMATH DE number 6673363
Cited in
(6)- Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- scientific article; zbMATH DE number 811323 (Why is no real title available?)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
This page was built for publication: Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of j
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394089)