A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

DOI10.1016/j.ejor.2004.07.074zbMath1079.90046OpenAlexW2042261753MaRDI QIDQ2572851

Fawaz S. Al-Anzi, Ali Allahverdi

Publication date: 4 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.074

zbMATH Keywords

SchedulingFlowshopBranch-and-boundLower and upper boundsDominance relationTotal completion timeDistributed database

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ The significance of reducing setup times/setup costs ⋮ A survey of scheduling problems with setup times or costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• Job lateness in a two-machine flowshop with setup times separated
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Two-machine flowshop scheduling to minimize mean flow time
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Scheduling tasks with sequence-dependent processing times
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Impact of sequence-dependent setup time on job shop scheduling performance
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times