A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time

[1]  Agostino Villa,et al.  Advanced Models for Manufacturing Systems Management , 1995 .

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[3]  A. D. Amar.  Costs in design of scheduling algorithms: a study on branch-and-bound methodology , 1997 .

[4]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[5]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[6]  C. Klein,et al.  Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness , 1999 .

[7]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[8]  Lixin Tang,et al.  A modified genetic algorithm for single machine scheduling , 1999 .

[9]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid , 1999 .

[10]  Andrew Kusiak,et al.  Scheduling manufacturing systems in an agile environment , 2001 .

[11]  Erwin Pesch,et al.  Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..

[12]  Alain Hertz,et al.  A framework for the description of evolutionary algorithms , 2000, Eur. J. Oper. Res..

[13]  K. F. Man,et al.  Multi-product planning and scheduling using genetic algorithm approach , 2000 .

[14]  Reha Uzsoy,et al.  Evaluation and comparison of production schedules , 2000 .