An integrated greedy heuristic for a flexible job shop scheduling problem
暂无分享,去创建一个
[1] Jacek Blazewicz,et al. The job shop scheduling problem: Conventional and new solution techniques , 1996 .
[2] Sheik Meeran,et al. Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..
[3] Johann L. Hurink,et al. Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .
[4] P. Bruckner,et al. An efficient algorithm for the job-shop problem with two jobs , 1988 .
[5] Stéphane Dauzère-Pérès,et al. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..
[6] Joyce Friedman,et al. A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..
[7] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..
[8] Stéphane Dauzère-Pérès,et al. Multi-resource shop scheduling with resource flexibility , 1998, Eur. J. Oper. Res..
[9] Nidhal Rezg,et al. Geometric approach and taboo search for scheduling flexible manufacturing systems , 2001, IEEE Trans. Robotics Autom..
[10] Jan Paulli,et al. A hierarchical approach for the FMS scheduling problem , 1995 .