New heuristics for total tardiness minimization in a flexible flowshop

DOI10.1007/s11590-012-0448-xzbMath1269.90043OpenAlexW1994219173MaRDI QIDQ1947616

Guilherme B. Mainieri, Débora P. Ronconi

Publication date: 23 April 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0448-x

zbMATH Keywords

heuristicsschedulingtardinessflexible flowshop

Mathematics Subject Classification ID

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

Related Items (3)

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• Flowshop/no-idle scheduling to minimize total elapsed time
• A taxonomy of flexible flow line scheduling procedures
• Global lower bounds for flow shops with multiple processors
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• Dynamic non-preemptive single machine scheduling
• A decomposition algorithm for the single machine total tardiness problem
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• A weighted modified due date rule for sequencing to minimize weighted tardiness
• Earliness and tardiness single machine scheduling with proportional weights
• Material allocation in MRP with tardiness penalties
• Minimizing Total Tardiness on One Machine is NP-Hard
• A computational study of heuristics for two-stage flexible flowshops
• Bottleneck-focused scheduling for a hybrid flowshop
• A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
• Single-machine scheduling with early and tardy completion costs
• The Total Tardiness Problem: Review and Extensions

This page was built for publication: New heuristics for total tardiness minimization in a flexible flowshop