Efficient methods to schedule re-entrant flowshop system

DOI10.3233/IFS-130771MaRDI QIDQ5174109zbMATH OpenOpenAlexFDO

Authors Naïm Yalaoui, Lionel Amodeo, Farouk Yalaoui, Halim Mahdi

Publication date 17 February 2015

Published in Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/ifs-130771

zbMATH Keywords

fuzzy logicgenetic algorithmparticle swarm optimizationre-entrant scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 6001874
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• scientific article; zbMATH DE number 7028188
• Lagrangian relaxation algorithm for scheduling problems of reentrant hybrid flow shops

Cited in

(8)

• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Reversible-shop scheduling
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
• Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
• scientific article; zbMATH DE number 6719013 (Why is no real title available?)
• scientific article; zbMATH DE number 6001874 (Why is no real title available?)
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub

This page was built for publication: Efficient methods to schedule re-entrant flowshop system

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