Job Shop Sequencing Problem on Two Machines with Time Lag Constraints
From MaRDI portal
Publication:5675544
DOI10.1287/MNSC.19.9.1063zbMath0258.90033OpenAlexW2148433912MaRDI QIDQ5675544
Publication date: 1973
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.9.1063
Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (3)
A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness ⋮ A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure ⋮ On-line two-machine job shop scheduling with time lags
This page was built for publication: Job Shop Sequencing Problem on Two Machines with Time Lag Constraints