Hybrid flow-shop scheduling problems with multiprocessor task systems.

DOI10.1016/S0377-2217(02)00644-6zbMath1044.90036OpenAlexW1975834065MaRDI QIDQ1410328

Van Ha Do, Adam Janiak, Yakov Zinder, Maciej Lichtenstein, Oguz, Ceyda

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00644-6

zbMATH Keywords

Dynamic programmingTabu searchSchedulingComplexity theory

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Complexity and performance of numerical algorithms (65Y20)

Related Items (16)

Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ New perspectives in VLSI design automation: deterministic packing by sequence pair ⋮ Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic ⋮ Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach ⋮ A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling independent two processor tasks on a uniform duo-processor system
• Some efficient heuristic methods for the flow shop sequencing problem
• Scheduling multiprocessor tasks on three dedicated processors
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Scheduling multiprocessor tasks -- An overview
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• A tabu search approach for the flow shop scheduling problem
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Minimizing makespan in hybrid flowshops
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Current trends in deterministic scheduling
• Scheduling UET task systems with concurrency on two parallel identical processors
• The flow shop with parallel machines: A tabu search approach
• Scheduling multiprocessor tasks for mean flow time criterion
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems
• Tabu Search—Part I
• Tabu Search—Part II
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage

This page was built for publication: Hybrid flow-shop scheduling problems with multiprocessor task systems.