A branch and bound algorithm for the two-stage assembly scheduling problem

DOI10.1016/S0377-2217(96)00312-8zbMath0921.90091OpenAlexW2088786941MaRDI QIDQ1280185

A. M. A. Hariri, Chris N. Potts

Publication date: 6 October 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00312-8

zbMATH Keywords

branch and boundmakespanmaximum completion timetwo-stage assembly scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (35)

Scheduling for two-stage production system with setup and assembly operations ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ 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 ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Collaborative optimization of workshop layout and scheduling ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing ⋮ Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis ⋮ Minimizing customer order lead-time in a two-stage assembly supply chain ⋮ Flow-shop scheduling with setup and assembly operations ⋮ 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 ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ The production scheduling problem in a multi-page invoice printing system ⋮ Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan ⋮ The two-stage assembly scheduling problem to minimize total completion time with setup times ⋮ A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints ⋮ 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 ⋮ A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints ⋮ Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling ⋮ A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Cites Work

• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Optimal two- and three-stage production schedules with setup times included
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: A branch and bound algorithm for the two-stage assembly scheduling problem