Mathematical aspects of the 3 × n job-shop sequencing problem
From MaRDI portal
Publication:4775690
DOI10.1002/nav.3800210110zbMath0287.90010OpenAlexW2102940080MaRDI QIDQ4775690
Publication date: 1974
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800210110
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ On three-machine flow shops with random job processing times ⋮ Sequency on two and three machines with setup, processing and removal times separated ⋮ Non-bottleneck machines in three-machine flow shops
Cites Work
This page was built for publication: Mathematical aspects of the 3 × n job-shop sequencing problem
