学科分类
/ 1
1 个结果
  • 简介:Thispaperconsiderssingle-machineschedulingproblemsingrouptechnologywiththejobs'processingtimesbeingsimplelinearfunctionsoftheirstarttimes.Theobjectivefunctionsaretheminimizingofmakespanandtotalweightedcompletiontime.SomeoptimalconditionsandalgorithmsaregivenandthefactthattheproblemoftotalweightedcompletiontimesisNP-hardisproved.

  • 标签: 排序问题 群论 工艺处理 时间约束 目标函数