Hybrid flow-shop scheduling problems with multiprocessor task systems
暂无分享,去创建一个
Ceyda Oguz | Adam Janiak | Maciej Lichtenstein | Van Ha Do | Yakov Zinder | A. Janiak | Y. Zinder | M. Lichtenstein | C. Oguz
[1] Joseph Y.-T. Leung,et al. Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..
[2] Jatinder N. D. Gupta,et al. Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .
[3] George L. Vairaktarakis,et al. Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..
[4] Abdelhakim Artiba,et al. A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..
[5] Jian Ma,et al. Theory and Methodology Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property : An investigation of generation mechanism , 1997 .
[6] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[7] Ceyda Oguz,et al. Scheduling multiprocessor tasks in a two-stage flow-shop environment , 1997 .
[8] Errol L. Lloyd,et al. Concurrent Task Systems , 1981, Oper. Res..
[9] Peter Brucker,et al. Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .
[10] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[11] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.
[12] Mohamed Haouari,et al. Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..
[13] Maciej Drozdowski,et al. Scheduling multiprocessor tasks -- An overview , 1996 .
[14] Eugeniusz Nowicki,et al. The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..
[15] Maciej Drozdowski,et al. Selected problems of scheduling tasks in multiprocessor computer systems , 1997 .
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] Mohamed Ben-Daya,et al. A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..
[18] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[19] Peter Brucker,et al. Scheduling UET task systems with concurrency on two parallel identical processors , 2000, Math. Methods Oper. Res..
[20] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..
[21] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[22] T. C. Edwin Cheng,et al. Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..
[23] Michael Pinedo,et al. Current trends in deterministic scheduling , 1997, Ann. Oper. Res..
[24] Bo Chen. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .
[25] Paolo Dell'Olmo,et al. Scheduling multiprocessor tasks for mean flow time criterion , 2000, Comput. Oper. Res..
[26] Günter Schmidt,et al. Scheduling independent two processor tasks on a uniform duo-processor system , 1990, Discret. Appl. Math..