scientific article; zbMATH DE number 7028188

DOI10.7641/CTA.2017.70465MaRDI QIDQ4623871zbMATH OpenFDO

Authors

Publication date 22 February 2019

Full work available at URL https://doi.org/10.7641/CTA.2017.70465

zbMATH Keywords

dynamic reentrant hybrid flowshopimproved dynamic programminginterleaved subgradient optimizationLagrangian relaxationtransportation time

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• Hybrid flowshop scheduling with interstage job transportation
• Reentrant hybrid flowshop scheduling problem based on total weighted completion time
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Flowshop scheduling with interstage job transportation
• Flow shop scheduling problems with transportation constraints revisited
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• A two-stage flow shop scheduling problem with transportation considerations
• A hybrid two-stage transportation and batch scheduling problem
• Two-stage hybrid flow shop scheduling with dynamic job arrivals

Cited in

(7)

• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Lagrangian relaxation algorithm for scheduling problems of reentrant hybrid flow shops
• scientific article; zbMATH DE number 6001874 (Why is no real title available?)
• Efficient methods to schedule re-entrant flowshop system
• Reentrant hybrid flowshop scheduling problem based on total weighted completion time
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem

This page was built for publication:

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