A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
From MaRDI portal
Publication:1596947
DOI10.1016/S0895-7177(99)00085-0zbMath0987.90032OpenAlexW2066204482WikidataQ57633963 ScholiaQ57633963MaRDI QIDQ1596947
D. Danneberg, Thomas Tautenhahn, Frank Werner
Publication date: 5 May 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(99)00085-0
Applications of mathematical programming (90C90) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A comprehensive review of flowshop group scheduling literature, Improved MILP models for two-machine flowshop with batch processing machines, A multi-objective particle swarm for a flow shop scheduling problem, A survey of scheduling problems with setup times or costs, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, Two-machine open shop scheduling with secondary criteria, No-wait flow shop scheduling using fuzzy multi-objective linear programming, Local search heuristics for two-stage flow shop problems with secondary criterion, TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Batching in single operation manufacturing systems
- How easy is local search?
- A survey of priority rule-based scheduling
- One-pass batching algorithms for the one-machine problem
- A new heuristic method for the flow shop sequencing problem
- Constructive heuristic algorithms for the open shop problem
- The complexity of one-machine batching problems
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Two-machine shop scheduling problems with batch processing
- Insertion techniques for the heuristic solution of the job shop problem
- Heuristics for permutation flow shop scheduling with batch setup times
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Improving local search heuristics for some scheduling problems. I
- A comparison of local search methods for flow shop scheduling
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- The Single Machine Early/Tardy Problem
- Some relations between neighbourhood graphs for a permutation problem
- The Lessons of Flowshop Scheduling Research
- Tabu Search—Part I
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Tabu Search—Part II
- A Survey of Scheduling Rules
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the application of insertion techniques for job shop problems with setup times
- Scheduling Groups of Jobs on a Single Machine
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Improving local search heuristics for some scheduling problems. II
