Hybrid flow-shop scheduling problems with multiprocessor task systems.

DOI10.1016/S0377-2217(02)00644-6MaRDI QIDQ1410328zbMATH OpenOpenAlexFDO

Authors Yakov Zinder, Van Ha Do, Adam Janiak, Maciej Lichtenstein, Ceyda Oğuz

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

Complexity theorySchedulingDynamic programmingTabu search

Mathematics Subject Classification ID

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

Recommendations

• Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic
• The hybrid flow shop scheduling problem
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Hybrid flowshop scheduling with machine and resource-dependent processing times
• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
• An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach

Cites work

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

Cited in

(21)

• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Hybrid tasks model of NC system and its optimal scheduling algorithm
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
• 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
• Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
• Scheduling jobs on a \(k\)-stage flexible flow-shop
• Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach
• A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• Preemptive hybrid flowshop scheduling problem of interval orders
• Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic
• Computational complexity of some scheduling problems with multiprocessor tasks
• New perspectives in VLSI design automation: deterministic packing by sequence pair
• Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations
• scientific article; zbMATH DE number 776077 (Why is no real title available?)
• The hybrid flow shop scheduling problem
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410328)