A single-objective heuristic algorithm subject to a given upper bound of maximum tardiness

zbMATH Open1240.68314MaRDI QIDQ3170916FDOQ3170916

Authors: Shuzhen Chi, Chunguang Zhou, Changsheng Zhang, Caoyuan Yang 

Publication date: 29 September 2011

Recommendations

• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
• Minimizing total tardiness in permutation flowshops
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

zbMATH Keywords

flowshop schedulingmakespaniterated greedymaximum tardiness

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• A note on the equivalence of two heuristics to minimize total tardiness

This page was built for publication: A single-objective heuristic algorithm subject to a given upper bound of maximum tardiness

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