ON N-JOB, 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH ARBITRARY TIME LAGS AND TRANSPORTATION TIMES OF JOBS

DOI10.15807/JORSJ.25.219zbMath0494.90042OpenAlexW415256648MaRDI QIDQ3958260

Parkash Lal Maggu, Noor Mohammad, Sri Krishan Yadav, Manohar Lal Singhal

Publication date: 1982

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.25.219

zbMATH Keywords

solution algorithmoptimal sequencetransportation times of jobsarbitrary time lagsminimal total elapsed timen- job 2-machine flow-shop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: ON N-JOB, 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH ARBITRARY TIME LAGS AND TRANSPORTATION TIMES OF JOBS