Minimizing total tardiness in no-wait flowshops
From MaRDI portal
Publication:2978428
Recommendations
- Minimizing total tardiness in permutation flowshops
- Some heuristics for no-wait flowshops with total tardiness criterion
- Stochastically minimizing total flowtime in flowshops with no waiting space
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- Scheduling in flowshops to minimize total tardiness of jobs
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
Cites work
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A survey of scheduling problems with setup times or costs
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- New heuristics for no-wait flowshops to minimize makespan.
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- No-wait flowshops with bicriteria of makespan and total completion time
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Cited in
(20)- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Minimizing total flow time and total completion time with immediate dispatching
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
- Minimizing total tardiness in permutation flowshops
- Scheduling in flowshops to minimize total tardiness of jobs
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
- On the exact solution of the no-wait flow shop problem with due date constraints
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- New heuristics for no-wait flowshops to minimize makespan.
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- On Eulerian extensions and their application to no-wait flowshop scheduling
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- Some heuristics for no-wait flowshops with total tardiness criterion
- A survey of scheduling problems with no-wait in process
This page was built for publication: Minimizing total tardiness in no-wait flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978428)
