A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates

DOI10.1080/002075498192896zbMATH Open0945.90560OpenAlexW2128158656WikidataQ57748078 ScholiaQ57748078MaRDI QIDQ4245645FDOQ4245645

Authors: 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

Recommendations

• Dynamic programming approach to the single-machine sequencing problem with different due-dates
• Publication:4723553
• Sequencing with restrictions in processing times
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Dynamic programming and decomposition approaches for the single machine total tardiness problem

Mathematics Subject Classification ID

Production models (90B30)

Cited In (8)

• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
• Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
• A flexible job shop scheduling model for sustainable manufacturing
• A survey of scheduling problems with setup times or costs
• Title not available (Why is that?)
• Dynamic programming for delayed product differentiation.
• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

This page was built for publication: A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245645)