Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
暂无分享,去创建一个
[1] Edward P. K. Tsang,et al. Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..
[2] Jacques Carlier,et al. Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .
[3] Chris N. Potts,et al. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..
[4] Bernd Jurisch,et al. Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines , 1995, Discret. Appl. Math..
[5] Eric Pinson,et al. Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem , 1998, Ann. Oper. Res..
[6] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[7] Luca Maria Gambardella,et al. Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .
[8] Chelliah Sriskandarajah,et al. Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .
[9] Marie-Claude Portmann,et al. Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..
[10] Michael A. Langston,et al. Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..
[11] George L. Vairaktarakis,et al. Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..
[12] Mohamed Haouari,et al. Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .
[13] S. Webster. A general lower bound for the makespan problem , 1996 .
[14] Philippe Baptiste,et al. Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .
[15] Bo Chen,et al. Scheduling Multiprocessor Flow Shops , 1994 .
[16] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[17] Eugene L. Lawler,et al. Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .
[18] Jan Karel Lenstra,et al. PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .
[19] W. A. Horn. Some simple scheduling algorithms , 1974 .
[20] Bo Chen. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .
[21] Eric Sanlaville,et al. Nearly on Line Scheduling of Preemptive Independent Tasks , 1995, Discret. Appl. Math..
[22] D. Santos,et al. Global lower bounds for flow shops with multiple processors , 1995 .
[23] R. E. Buten,et al. Scheduling model for computer systems with two classes of processors , 1972 .
[24] J. Hunsucker,et al. BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .
[25] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[26] Mohamed Haouari,et al. An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines , 2003, Oper. Res. Lett..