Heuristic-Programming Solution of a Flowshop-Scheduling Problem
From MaRDI portal
Publication:4767113
DOI10.1287/opre.22.3.629zbMath0279.90021OpenAlexW2141662708MaRDI QIDQ4767113
Martin J. Krone, Kenneth Steiglitz
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.3.629
Related Items
The two-machine sequence dependent flowshop scheduling problem ⋮ The maximal dispersion problem and the ``first point outside the neighbourhood heuristic ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A new approach to choosing initial points in local search ⋮ A comparison of local search methods for flow shop scheduling ⋮ A functional approach to modelling of manufacturing processes ⋮ Systematic choice of initial points in local search: Extensions and application to neural networks ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop ⋮ Heuristic methods and applications: A categorized survey ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ Some results of the worst-case analysis for flow shop scheduling
