Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

DOI10.1016/S0305-0548(99)00010-6zbMATH Open0944.90021OpenAlexW2076134632MaRDI QIDQ1968586FDOQ1968586

Authors: Ali Allahverdi 

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

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

zbMATH Keywords

branch-and-bound algorithmheuristicschedulingmean flowtimetwo-machine flowshop problemseparate setup time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (22)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• An approximate solution of the flow-shop problem with sequence dependent setup times
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
• 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
• Job lateness in a two-machine flowshop with setup times separated
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• A survey of scheduling problems with setup times or costs
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
• Two models for a family of flowshop sequencing problems
• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
• Title not available (Why is that?)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
• Minimizing flow time in a flow-line manufacturing cell with family setup times
• 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

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)