A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
type: Item
instance of: scholarly article
title: A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
zbMATH Open document ID: 0987.90032
DOI: 10.1016/S0895-7177(99)00085-0
author: D. Danneberg
author: Thomas Tautenhahn
author: Frank Werner
published in: Mathematical and Computer Modelling
publication date: 2002-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1737683
zbMATH Keywords: insertion algorithms
zbMATH Keywords: local search
zbMATH Keywords: multilevel heurstics
Wikidata QID: Q57633963
MaRDI profile type: Publication
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Q4124328
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems
cites work: Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Q3778531
cites work: On the heuristic solution of the permutation flow shop problem by path algorithms
cites work: A new heuristic method for the flow shop sequencing problem
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
cites work: The Lessons of Flowshop Scheduling Research
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: The complexity of one-machine batching problems
cites work: One-pass batching algorithms for the one-machine problem
cites work: Batching in single operation manufacturing systems
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Heuristics for permutation flow shop scheduling with batch setup times
cites work: Q3479795
cites work: Insertion techniques for the heuristic solution of the job shop problem
cites work: Constructive heuristic algorithms for the open shop problem
cites work: The Single Machine Early/Tardy Problem
cites work: On the application of insertion techniques for job shop problems with setup times
cites work: A survey of priority rule-based scheduling
cites work: A Survey of Scheduling Rules
cites work: Some relations between neighbourhood graphs for a permutation problem
cites work: Q3785827
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
cites work: A comparison of local search methods for flow shop scheduling
cites work: Q3981972
cites work: Job-shop scheduling: Computational study of local search and large-step optimization methods
cites work: Improving local search heuristics for some scheduling problems. I
cites work: Improving local search heuristics for some scheduling problems. II
cites work: How easy is local search?
cites work: Benchmarks for basic scheduling problems
cites work: Two-machine shop scheduling problems with batch processing
full work available at URL: s0895-7177(99)00085-0
OpenAlex ID: W2066204482
description: scientific article; zbMATH DE number 1737683