A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations

DOI10.1016/j.apm.2013.06.005zbMath1427.90137OpenAlexW2170006013MaRDI QIDQ1991311

Fariborz Jolai, Reza Tavakkoli-Moghaddam, Seyed Mohammad Hassan Hosseini, Pariviz Fattahi

Publication date: 30 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.06.005

zbMATH Keywords

schedulingbranch and boundsetup timehybrid flow shopassembly

Mathematics Subject Classification ID

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

Related Items (9)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Shop scheduling in manufacturing environments: a review ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times

Cites Work

• Evaluation of mathematical models for flexible job-shop scheduling problems
• Hybrid flowshop scheduling with machine and resource-dependent processing times
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
• Branch and bound algorithm for the flow shop with multiple processors
• A taxonomy of flexible flow line scheduling procedures
• 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 the two-stage assembly scheduling problem
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• The hybrid flow shop scheduling problem
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
• Flow-shop scheduling with setup and assembly operations
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
• A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Handbook on Scheduling
• Scheduling

This page was built for publication: A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations