The Management of Innovation and Technology

[1]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[2]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[3]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[4]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[5]  S. H. Choi,et al.  A machine‐order search space for job‐shop scheduling problems , 2003 .

[6]  Anita Lee,et al.  Flexible manufacturing system (FMS) scheduling using filtered beam search , 1990, J. Intell. Manuf..

[7]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[8]  C. B. Besant,et al.  Job-shop scheduling using certain heuristic search algorithms , 1992 .

[9]  Hirofumi Matsuo,et al.  A bottleneck-based beam search for job scheduling in a flexible manufacturing system , 1989 .

[10]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[11]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[12]  Marc Lambrecht,et al.  Extending the shifting bottleneck procedure to real-life applications , 1996 .

[13]  Amar Ramudhin,et al.  The generalized Shifting Bottleneck Procedure , 1996 .

[14]  Robert H. Storer,et al.  Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..

[15]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[16]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[17]  Reha Uzsoy,et al.  Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study , 1996 .