A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
From MaRDI portal
Publication:4245645
DOI10.1080/002075498192896zbMath0945.90560OpenAlexW2128158656WikidataQ57748078 ScholiaQ57748078MaRDI QIDQ4245645
A. İhsan Sönmez, Adil Baykasoǧlu
Publication date: 1998
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075498192896
Related Items (6)
Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ Dynamic programming for delayed product differentiation. ⋮ A survey of scheduling problems with setup times or costs ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
This page was built for publication: A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
