heuristics package#

Submodules#

heuristics.batch_splitting module#

class heuristics.batch_splitting.Alg_B_SPLIT(data_source)#

Bases: solutions.algorithm_template.AlgorithmTemplate

b_sched(b_split_result, processing_times, po_rowid=2000, scheduling_example_file=None)#
b_split(po_rowid=2000, split_by_piece=False)#
get_op_workstations(operation_list)#
solve(po_rowid=2000, scheduling_example_file=None)#

Method used to start the sheduling algorithm :return: makespan

heuristics.batch_splitting.b_split_example(insert_op=True, insert_ps=True)#

heuristics.letsa module#

class heuristics.letsa.Alg_LETSA(data_source, logging_level=30)#

Bases: solutions.algorithm_template.AlgorithmTemplate

generate_dataframe()#
Parameters

scheduling_file

Returns

generate_plot(output_path)#
Parameters
  • dataframe – the data source for gantt diagram

  • output_file

Returns

get_cumulative_proc_time(network_path, processing_time)#
get_network_paths(operation)#
get_network_pathsRec(root_operation, path, pathLen, all_paths)#
get_processing_time(operation, processing_time)#
solve(po_rowid=None, processing_time='min')#

Method used to start the sheduling algorithm :return: makespan

Module contents#