A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
From MaRDI portal
Publication:3982632
DOI10.15807/jorsj.34.28zbMath0736.90044OpenAlexW2136131027MaRDI QIDQ3982632
Dipak Chaudhuri, Chandrasekharan Rajendran
Publication date: 26 June 1992
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.34.28
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, Some results of the worst-case analysis for flow shop scheduling
