算法导论第十五章-装配线高度算法实现

assembly_line_scheduling.h

#ifndef _ASSEMBLY_LINE_SCHEDULING
#define _ASSEMBLY_LINE_SCHEDULING

typedef struct _line_node
{
	int consume_time; // 该结点消耗时间
	int move_time; // 从该结点移动到另条生产线消耗时间~
} LineNode;

typedef LineNode AssemblyLine[];
  
#define N  6 // 生产线结点个数

/* 找出最快生产线 */
void fastest_way();
/* 并打印 */
void print_stations();

#endif

 

assembly_line_scheduling.cpp

#include "assembly_line_scheduling.h"
#include <stdio.h>

// 定义第一条生产线，包括N个结点，以及运至生产线L1头结点L1[1]所花时间L1[0].move_time，以及运出生产线所花时间L1[N].move_time。
AssemblyLine a1= {{0,2}, {7,2}, {9,3}, {3,1},{4,3},{8,4},{4,3}}; 
AssemblyLine a2= {{0,4}, {8,2}, {5,1}, {6,2},{4,2},{5,1},{7,2}}; // 定义第二条生产线~

int f1[N+1]; // 忽略第f1[0]结点，~
int l1[N+1]; // 忽略第l1[0]、l1[1]两个结点，~
int f2[N+1];
int l2[N+1]; 

int f_final = 0;
int l_final = 0;
void fastest_way()
{
	int i;
	// 初始化头结点，从起点至头结点的移动时间+该结点消耗时间~
	f1[1] = a1[0].move_time+a1[1].consume_time;
	f2[1] = a2[0].move_time+a2[1].consume_time;

	for(i = 2; i <= N; i++)
	{
		// 找出生产线L1[i]的最快来源结点~
		if(f1[i-1] > (f2[i-1]+a2[i-1].move_time))
		{
			f1[i] = f2[i-1]+a2[i-1].move_time+a1[i].consume_time;
			l1[i] = 2;
		}
		else
		{
			f1[i] = f1[i-1]+a1[i].consume_time;
			l1[i] = 1;			
		}

		// 找出生产线L2[i]的最快来源结点~
		if(f2[i-1] > (f1[i-1]+a1[i-1].move_time))
		{
			f2[i] = f1[i-1]+a1[i-1].move_time+a2[i].consume_time;
			l2[i] = 1;
		}
		else
		{
			f2[i] = f2[i-1]+a2[i].consume_time;
			l2[i] = 2;			
		}
	}

	if((f1[N]+a1->move_time)<(f2[N]+a2->move_time))
	{
		f_final = f1[N]+a1->move_time;
		l_final= 1;
	}
	else
	{
		f_final = f2[N]+a2->move_time;
		l_final= 2;		
	}
}

void print_stations()
{
	int i = l_final;
	int j;
	printf("line %-4d, station:%d\n", i, N);
 	for( j=N; j > 1; j--)
	{
		if(i == 1)
		{
			i = l1[j];	
		}
		else
		{
			i=l2[j];
		}
		
		printf("line %-4d, station:%d\n", i, j-1);
	}
}

int main()
{
	fastest_way();

	print_stations();

	return 0;
}