A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
文件大小:
1534k
资源说明:This paper addresses a two-machine no-wait job shop problem with makespan minimisation. It is well known
that this problem is strongly NP-hard. A divide-and-conquer approach (DC for short) is adopted to calculate
the optimal timetable of a given sequence. It decomposes the given sequences into several independent parts
and conquers them separately. A timetable enhancing method is introduced to further improve the timetable
obtained by DC. It constructs a set of flow shop
that this problem is strongly NP-hard. A divide-and-conquer approach (DC for short) is adopted to calculate
the optimal timetable of a given sequence. It decomposes the given sequences into several independent parts
and conquers them separately. A timetable enhancing method is introduced to further improve the timetable
obtained by DC. It constructs a set of flow shop
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。