New heuristics for total tardiness minimization in a flexible flowshop
From MaRDI portal
(Redirected from New heuristics for total tardiness minimization in a flexible flowshop)
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
Cites work
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- A computational study of heuristics for two-stage flexible flowshops
- A decomposition algorithm for the single machine total tardiness problem
- A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
- A taxonomy of flexible flow line scheduling procedures
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Bottleneck-focused scheduling for a hybrid flowshop
- Dynamic non-preemptive single machine scheduling
- Earliness and tardiness single machine scheduling with proportional weights
- Flowshop/no-idle scheduling to minimize total elapsed time
- Global lower bounds for flow shops with multiple processors
- Handbook of applied optimization
- scientific article; zbMATH DE number 3119645 (Why is no real title available?)
- Material allocation in MRP with tardiness penalties
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- Minimizing Total Tardiness on One Machine is NP-Hard
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Single-machine scheduling with early and tardy completion costs
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- The hybrid flow shop scheduling problem
- The Total Tardiness Problem: Review and Extensions
Cited in
(8)- Heuristics for minimizing total weighted tardiness in flexible flow shops
- 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
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Heuristics for minimizing total weighted tardiness in complex job shops
- 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)
