Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags

DOI10.1287/mnsc.5.3.299zbMath0995.90537OpenAlexW2108451944MaRDI QIDQ2778608

Selmer Johnson

Publication date: 22 October 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.5.3.299

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (5)

Lot streaming in the two-machine flow shop with setup times ⋮ Two- and three-machine flow shop scheduling problems with equal sized transfer batches ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The master-slave paradigm in parallel computer and industrial settings ⋮ Non-bottleneck machines in three-machine flow shops

This page was built for publication: Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags