A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

DOI10.1080/00207160701331376zbMath1134.90385OpenAlexW2022297072MaRDI QIDQ5431617

G. Prabhaharan, B. Shahul Hamid Khan, P. Asokan

Publication date: 12 December 2007

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701331376

zbMATH Keywords

makespanflow shopGRASP algorithmmetaheuristic

Mathematics Subject Classification ID

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

Related Items (2)

Uncertain flexible flow shop scheduling problem subject to breakdowns ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation

Cites Work

• Minimizing total tardiness in permutation flowshops
• Multiple and bicriteria scheduling: A literature survey
• A greedy randomized adaptive search procedure for the feedback vertex set problem
• Greedy randomized adaptive search procedures
• Semi-greedy heuristics: An empirical study
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Benchmarks for basic scheduling problems
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• Optimal two- and three-stage production schedules with setup times included
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness