Solutions to the Constrained Flowshop Sequencing Problem
From MaRDI portal
Publication:4114935
DOI10.1057/jors.1976.176zbMath0345.90020OpenAlexW2089155447MaRDI QIDQ4114935
Publication date: 1976
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1976.176
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10)
Related Items
A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ No-wait flowshops with bicriteria of makespan and maximum lateness. ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ Heuristics for no-wait flowshops with makespan subject to mean completion time ⋮ A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem ⋮ Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ A survey and evaluation of static flowshop scheduling heuristics ⋮ Design and scheduling of flexible assembly lines for printed circuit boards ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ A new heuristic for the n-job, M-machine flow-shop problem ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm
