Heuristic-Programming Solution of a Flowshop-Scheduling Problem

DOI10.1287/OPRE.22.3.629MaRDI QIDQ4767113zbMATH OpenOpenAlexFDO

Authors Martin J. Krone, Ken 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(13)

• The two-machine sequence dependent flowshop scheduling problem
• A new approach to choosing initial points in local search
• Systematic choice of initial points in local search: Extensions and application to neural networks
• Some results of the worst-case analysis for flow shop scheduling
• Heuristic methods and applications: A categorized survey
• A comparison of local search methods for flow shop scheduling
• 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 functional approach to modelling of manufacturing processes
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• On the heuristic solution of the permutation flow shop problem by path algorithms
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times

This page was built for publication: Heuristic-Programming Solution of a Flowshop-Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767113)