Heuristics for permutation flow shop scheduling with batch setup times

DOI10.1007/BF01539731zbMath0858.90079OpenAlexW2083984163WikidataQ57633992 ScholiaQ57633992MaRDI QIDQ1814870

Frank Werner, Thomas Tautenhahn, Yuri N. Sotskov

Publication date: 31 October 1996

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01539731

zbMATH Keywords

heuristicsbeam searchmakespangroup technologysum of completion timespermutation flow shop schedulingbatch setup timesmanufactoring cells

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A comprehensive review of flowshop group scheduling literature, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, Scheduling with batching: A review, Local search heuristics for two-stage flow shop problems with secondary criterion, Flowshop-scheduling problems with makespan criterion: a review, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Cites Work

• 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
• Single facility scheduling with multiple job classes
• 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
• Simulated annealing procedures for forming machine cells in group technology
• Two-machine shop scheduling problems with batch processing
• Insertion techniques for the heuristic solution of the job shop problem
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
• A new heuristic for the n-job, M-machine flow-shop problem
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Batching to Minimize Flow Times on One Machine
• The Single Machine Early/Tardy 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
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• The Complexity of Flowshop and Jobshop Scheduling
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item