Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
From MaRDI portal
Publication:958459
DOI10.1016/j.cor.2007.12.013zbMath1160.90483OpenAlexW2077773094MaRDI QIDQ958459
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.12.013
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A decomposition algorithm for the single machine total tardiness problem
- Benchmarks for basic scheduling problems
- A survey of scheduling problems with setup times or costs
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Optimal two- and three-stage production schedules with setup times included
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling in flowshops to minimize total tardiness of jobs
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Flowshop-scheduling problems with makespan criterion: a review
