Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
From MaRDI portal
Publication:1968586
DOI10.1016/S0305-0548(99)00010-6zbMath0944.90021OpenAlexW2076134632MaRDI QIDQ1968586
Publication date: 26 September 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00010-6
branch-and-bound algorithmschedulingheuristicmean flowtimetwo-machine flowshop problemseparate setup time
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, A survey of scheduling problems with setup times or costs, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, Unnamed Item, Two-machine flowshop scheduling with job class setups to minimize total flowtime, Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, Two models for a family of flowshop sequencing problems, Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm, A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem, The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
