Scheduling Problem with Multiprocessor Tasks Ceyda Oguz Adam Janiak + Maciej ...  Home/Search
Context
Related
| 143.129.203.3/eume...IC2001_477_482.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 143.129.203.3/eum...allpapers.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is concerned with hybrid flow-shop scheduling problem involving multiprocessor tasks. The hybrid flow-shop problem is a generalization of the classical flow-shop problem by permitting multiple parallel processors at each stage of task processing. The multiprocessor tasks, on the other hand, overcome the restriction of the classical scheduling problems by allowing tasks to be processed on more than one processor simultaneously. The hybrid flow-shop is defined by the set M = ..., m} ... (Update)
Active bibliography (related documents): More All
0.6: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.2: Applying Iterated Local Search to the Permutation Flow Shop Problem - Stützle (1998) (Correct)
0.2: An Ant Approach to the Flow Shop Problem - Stützle (1997) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Scheduling a Single Machine with Resource Dependent Release.. - Janiak, Potts, al. (2000) (Correct)
0.3: Heuristic Algorithms for Multiprocessor Task Scheduling in a .. - Oguz, Ercan, al. (2000) (Correct)
0.2: Scheduling Multiprocessor Tasks on Dedicated Processors - Krämer (1995) (Correct)
BibTeX entry: (Update)
@misc{ with-metaheuristic,
author = "Scheduling Problem With",
title = "Metaheuristic Algorithms for Hybrid Flow-Shop",
url = "citeseer.ist.psu.edu/661936.html" }
Citations (may not include all citations):417 Local Search in Combinatorial Optimization (context) - AartsandJ, Lenstra - 1997
170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
76 ORSA Journal on Computing (context) - Glover, Part - 1990
76 ORSA Journal on Computing (context) - Glover, Part - 1989
63 Optimisation by simulated annealing (context) - Kirkpatrick, Gelatt et al. - 1983
5 job flowshop sequencing problem (context) - Nawaz, Enscore et al. - 1983
1 A tabu search approach for the flow shop scheduling problem (context) - Ben-Daya, Al-Fawzan - 1998
1 cient heuristic methods for the flow shop sequencing sroblem (context) - Taillard - 1983
1 Application of the simulated annealing algorithm to the comb.. (context) - Tian, Ma et al. - 1999
Documents on the same site (http://143.129.203.3/eume/MIC2001/allpapers.php): More
A Look-Ahead Addition to the Ant Colony Optimization.. - Gagne, Gravel, Price (2001) (Correct)
Heuristics for Large Strip Packing Problems with Guillotine.. - Valenzuela, Wang (2001) (Correct)
A Local Search Approach to the Resource Constrained Project.. - Nonobe, Ibaraki (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC