Algorithms for two-machine flow-shop sequencing with precedence constraints

DOI10.1016/0377-2217(84)90238-8zbMath0551.90041OpenAlexW2083877644MaRDI QIDQ800822

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

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90238-8

zbMATH Keywords

branch-and-bound algorithmLagrangean relaxationprecedence constraintstwo-machine flow-shoplower bounding ruleminimizing the maximum completion time

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

The two-machine flow shop problem with arbitrary precedence relations ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Cellular control of manufacturing systems

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• Scheduling two job classes on a single machine
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
• Sequencing to Minimize the Maximum Job Cost
• The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
• A General Bounding Scheme for the Permutation Flow-Shop Problem

This page was built for publication: Algorithms for two-machine flow-shop sequencing with precedence constraints