New heuristics for total tardiness minimization in a flexible flowshop
From MaRDI portal
Publication:1947616
DOI10.1007/S11590-012-0448-XzbMATH Open1269.90043OpenAlexW1994219173MaRDI QIDQ1947616FDOQ1947616
Débora P. Ronconi, Guilherme B. Mainieri
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
Recommendations
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A flexible flowshop problem with total flow time minimization
- Minimizing total tardiness in permutation flowshops
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Some heuristics for no-wait flowshops with total tardiness criterion
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- The hybrid flow shop scheduling problem
- Handbook of applied optimization
- Global lower bounds for flow shops with multiple processors
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Minimizing Total Tardiness on One Machine is NP-Hard
- A taxonomy of flexible flow line scheduling procedures
- Title not available (Why is that?)
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- Bottleneck-focused scheduling for a hybrid flowshop
- Single-machine scheduling with early and tardy completion costs
- A decomposition algorithm for the single machine total tardiness problem
- A computational study of heuristics for two-stage flexible flowshops
- The Total Tardiness Problem: Review and Extensions
- Flowshop/no-idle scheduling to minimize total elapsed time
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- Dynamic non-preemptive single machine scheduling
- A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
- Material allocation in MRP with tardiness penalties
- Earliness and tardiness single machine scheduling with proportional weights
Cited In (7)
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- Heuristics for minimizing total weighted tardiness in complex job shops
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- 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
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
This page was built for publication: New heuristics for total tardiness minimization in a flexible flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947616)
