Job Shop Sequencing Problem on Two Machines with Time Lag Constraints

DOI10.1287/MNSC.19.9.1063MaRDI QIDQ5675544zbMATH OpenOpenAlexFDO

Authors S. S. Panwalkar

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

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10)

Cited in

(3)

• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675544)