A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
From MaRDI portal
(Redirected from Publication:1869904)
Recommendations
- A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
- A branch and bound algorithm for the two-stage assembly scheduling problem
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Two-Stage Flowshop Scheduling Problem with Bicriteria
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 three-stage assembly flowshop scheduling problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
Cited in
(24)- The two-stage assembly scheduling problem to minimize total completion time with setup times
- A branch and bound algorithm for the two-stage assembly scheduling problem
- A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
- A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- scientific article; zbMATH DE number 6673363 (Why is no real title available?)
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- 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
- Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
- Lot streaming for a two-stage assembly system in the presence of handling costs
- 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
This page was built for publication: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869904)
