Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
From MaRDI portal
Publication:5608996
DOI10.1287/opre.12.3.471zbMath0208.45704OpenAlexW2026764613MaRDI QIDQ5608996
Publication date: 1964
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.12.3.471
Related Items
Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines ⋮ Flow-shops with a dominant machine ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Incomplete information and multiple machine queueing problems ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Flowshop scheduling research after five decades ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion ⋮ Flowshop/no-idle scheduling to minimize total elapsed time
