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

DOI10.1057/palgrave.jors.2602642zbMath1168.90649OpenAlexW2088511615MaRDI QIDQ3394089

Y. Deepa, Chandrasekharan Rajendran, N. Madhushini

Publication date: 28 August 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602642

zbMATH Keywords

assignment problemflowshop schedulingweighted tardinessbranch-and-bound algorithmsweighted flowtimeweighted earliness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed

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