A DE-LS Metaheuristic Algorithm for Hybrid Flow-Shop Scheduling Problem considering Multiple Requirements of Customers

Table 2

Notations in the paper.

N	The total number of jobs
N	The index of jobs
C	The total number of customers
C	The index of customers
M	The total number of machines
m	The index of machines
J	The total number of working processes
j	The index of working processes
k	The number of production types
	The demands number of customer c for production with type k
	The latest delivery time of customer c
	1, if the machine m in the j working process; 0, otherwise
	The processing time of production with type k in the j working process in machine m
	The begin time of job n in the j working process in machine m
	The completion time of job n in the j working process in machine m
	The maximum number of jobs can be assigned to machine m in the same working process
	The penalty cost of customer c if the latest delivery time is not satisfied