Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
From MaRDI portal
Recommendations
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- A new heuristic and dominance relations for no-wait flowshops with setups
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
Cited in
(23)- scientific article; zbMATH DE number 4074798 (Why is no real title available?)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Minimizing flow time in a flow-line manufacturing cell with family setup times
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- A survey of scheduling problems with setup times or costs
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Job lateness in a two-machine flowshop with setup times separated
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Two models for a family of flowshop sequencing problems
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- An approximate solution of the flow-shop problem with sequence dependent setup times
This page was built for publication: Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968586)
