Research on Flexible Job Shop Batching and Scheduling Problem with Setup Times
暂无分享,去创建一个
[1] Purushothaman Damodaran,et al. Scheduling a capacitated batch-processing machine to minimize makespan , 2007 .
[2] Rasaratnam Logendran,et al. A bi-objective batch processing problem with dual-resources on unrelated-parallel machines , 2017, Appl. Soft Comput..
[3] Xin Zhang,et al. Local search algorithm with path relinking for single batch-processing machine scheduling problem , 2017, Neural Computing and Applications.
[4] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[5] Lee J. Krajewski,et al. Kanban, MRP, and Shaping the Manufacturing Environment , 1987 .
[6] Jon K. Wilbrecht,et al. The Influence of Setup Time on Job Shop Performance , 1969 .
[7] Andrew J. Mason,et al. A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness , 2017, Eur. J. Oper. Res..
[8] Mohammad Saidi-Mehrabad,et al. Flexible job shop scheduling with tabu search algorithms , 2007 .
[9] Mojtaba Afzalirad,et al. Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions , 2018, J. Intell. Manuf..
[10] T. C. Edwin Cheng,et al. The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard , 2003, J. Sched..
[11] Gilbert Laporte,et al. Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times , 2018, Eur. J. Oper. Res..