Total completion time with makespan constraint in no-wait flowshops with setup times
From MaRDI portal
(Redirected from Publication:296867)
Recommendations
- No-wait flowshops with bicriteria of makespan and total completion time
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Total flowtime in no-wait flowshops with separated setup times.
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
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 hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A survey of scheduling problems with setup times or costs
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- No-wait flowshops with bicriteria of makespan and total completion time
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- The significance of reducing setup times/setup costs
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
Cited in
(16)- A survey of scheduling problems with no-wait in process
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- No-wait flowshops with bicriteria of makespan and total completion time
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm
- An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- The third comprehensive survey on scheduling problems with setup times/costs
- A memetic algorithm for restoring feasibility in scheduling with limited makespan
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Shop scheduling in manufacturing environments: a review
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Dynamic facility layout problem based on open queuing network theory
- Scheduling with time-of-use costs
This page was built for publication: Total completion time with makespan constraint in no-wait flowshops with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296867)