车间调度 遗传算法

车间调度 遗传算法

【2021-07-06更新】

测试地址更新：算法模块在服务器部署。

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.PrintWriter;import java.net.InetSocketAddress;import java.net.Socket;import java.net.SocketAddress;import java.util.Scanner;public class Main { public static void main(String[] args) throws IOException { SocketAddress address = new InetSocketAddress("82.157.191.64", 12345); Socket sock = new Socket(); sock.connect(address); BufferedReader is = null; PrintWriter os = null; os = new PrintWriter(sock.getOutputStream()); //管道的写工具 is = new BufferedReader(new InputStreamReader(sock.getInputStream())); //管道的读工具 int n, m; Scanner sc = new Scanner(System.in); System.out.println("所有数据请用空格或换行分割，不要添加其他字符"); System.out.println("机器编号从0开始，请不要超出指定数量m"); System.out.println("请输入工件数量n 机器数量m:"); String str = new String(); n = sc.nextInt(); m = sc.nextInt(); str += n + " " + m + " "; for (int i = 0; i < n; ++i) { int p; System.out.println("请输入job_" + i + "的工序数量p"); p = sc.nextInt(); str += p + " "; while (p-- > 0) { int x, y; System.out.println("请输入机器号x, 运行时间y"); x = sc.nextInt(); y = sc.nextInt(); str += x + " " + y + " "; } } os.write(str); os.flush(); System.out.println("已发送..."); str = ""; while ((str = is.readLine()) != null) { if(str.equals("-1")) { break; } System.out.println(str); } os.close(); is.close(); sock.close(); }}

输入样例

3 330 31 22 230 22 11 421 42 3

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。