Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
From MaRDI portal
Publication:4658429
DOI10.1057/palgrave.jors.2601110zbMath1131.90346OpenAlexW2042007290MaRDI QIDQ4658429
Ali Allahverdi, Tariq A. Aldowaisan
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601110
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, New heuristics for no-wait flowshops to minimize makespan., Concurrent flowshop scheduling to minimize makespan., A survey of scheduling problems with setup times or costs, A survey of scheduling problems with no-wait in process, Flowshop/no-idle scheduling to minimise the mean flowtime, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
