Hybrid flow-shop scheduling problems with multiprocessor task systems.
From MaRDI portal
Publication:1410328
DOI10.1016/S0377-2217(02)00644-6zbMath1044.90036MaRDI QIDQ1410328
Oguz, Ceyda, Adam Janiak, Yakov Zinder, Maciej Lichtenstein, Van Ha Do
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B40: Search theory
90B35: Deterministic scheduling theory in operations research
90C39: Dynamic programming
65Y20: Complexity and performance of numerical algorithms
Related Items
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
