Reentrant hybrid flowshop scheduling problem based on total weighted completion time

DOI10.13195/J.KZYJC.2017.0907MaRDI QIDQ5381273zbMATH OpenFDO

Authors

Publication date 21 June 2019

Full work available at URL https://doi.org/10.13195/J.KZYJC.2017.0907

zbMATH Keywords

reentrant hybrid flowshop schedulingtotal weighted completion timetransportation time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 7028188
• Minimizing total completion time for re-entrant flow shop scheduling problems
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop

Cited in

(2)

• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• scientific article; zbMATH DE number 7028188 (Why is no real title available?)

This page was built for publication: Reentrant hybrid flowshop scheduling problem based on total weighted completion time

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