A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

DOI10.1016/j.cor.2007.10.004zbMath1157.90417OpenAlexW2086672027WikidataQ57633880 ScholiaQ57633880MaRDI QIDQ954034

Manop Reodecha, Jitti Jungwattanakit, Paveena Chaovalitwongse, Frank Werner

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.004

zbMATH Keywords

simulated annealingtabu searchgenetic algorithmsflexible flow shopconstructive algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Related Items (23)

Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Dynamic routing strategies for JIT production in hybrid flow shops ⋮ Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ A memetic algorithm for the flexible flow line scheduling problem with processor blocking ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ Shifting representation search for hybrid flexible flowline problems ⋮ Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Scheduling of flexible flow lines in an automobile assembly plant
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• A genetic algorithm for flowshop sequencing
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• The flow shop with parallel machines: A tabu search approach
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Future paths for integer programming and links to artificial intelligence
• A survey of scheduling problems with setup times or costs
• Convergence of an annealing algorithm
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Evaluation of Flow Shop Sequencing Heuristics
• A computational study of heuristics for two-stage flexible flowshops
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem

This page was built for publication: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria