A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
From MaRDI portal
Publication:1869904
DOI10.1016/S0305-0548(01)00098-3zbMath1029.90031OpenAlexW2059573430MaRDI QIDQ1869904
Ali Tozkapan, Chia-Shin Chung, ömer Kirca
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00098-3
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop ⋮ A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times ⋮ A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ The two-stage assembly scheduling problem to minimize total completion time with setup times ⋮ A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application ⋮ Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
Cites Work
- A branch and bound algorithm for the two-stage assembly scheduling problem
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The three-stage assembly flowshop scheduling problem
This page was built for publication: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
