A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
From MaRDI portal
Publication:3596698
DOI10.1080/00207540701500486zbMath1152.90428OpenAlexW1978754971MaRDI QIDQ3596698
Marcello Braglia, Andrea Grassi
Publication date: 29 January 2009
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701500486
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Development and evaluation of five fuzzy multiattribute decision-making methods
- Heuristics for scheduling in flowshop with multiple objectives
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A new heuristic for the n-job, M-machine flow-shop problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Multicriteria scheduling problems: a survey
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An Evaluation of Flow Shop Sequencing Heuristics
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Local search heuristics for two-stage flow shop problems with secondary criterion
This page was built for publication: A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
