Flow shop-sequencing problem with synchronous transfers and makespan minimization

DOI10.1080/00207540600621672zbMath1128.90502OpenAlexW2064741724MaRDI QIDQ5438669

Banu Soylu, ömer Kirca, Azizoglu, Meral

Publication date: 24 January 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600621672

zbMATH Keywords

schedulingbranch-and-boundmakespanflow shops

Mathematics Subject Classification ID

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

Related Items (11)

Flow shop scheduling with flexible processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ Open shop scheduling with synchronization ⋮ Decomposition algorithms for synchronous flow shop problems with additional resources and setup times ⋮ Analysis of flow shop scheduling anomalies ⋮ Synchronous flow shop scheduling with pliable jobs ⋮ Complexity results for flow shop problems with synchronous movement ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines

Cites Work

• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• A comprehensive review and evaluation of permutation flowshop heuristics
• The Lessons of Flowshop Scheduling Research
• A Comparative Study of Flow-Shop Algorithms
• The Complexity of Flowshop and Jobshop Scheduling
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Flow shop-sequencing problem with synchronous transfers and makespan minimization