TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
From MaRDI portal
Publication:3703568
DOI10.15807/jorsj.27.348zbMath0581.90038OpenAlexW2185440801MaRDI QIDQ3703568
Ichiro Nabeshima, Shigeko Maruyama
Publication date: 1984
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.27.348
sufficient optimality conditionsapproximate sequenceadditional timestwo- and three-machine flow-shop makespan scheduling
Related Items (2)
A two-machine flowshop scheduling problem with a separated maintenance constraint ⋮ Two-machine flowshop group scheduling problem
This page was built for publication: TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
