A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Table 1

Papers with mathematical programming-based methods before and from Y2010 onwards.

	Before the year 2010			From the year 2010 onwards
	Scheduling	Rescheduling	VRP	Scheduling	Rescheduling	VRP
B&P	13	0	3	23	0	16
B&C	9	0	7	8	0	10
B&B	89	0	2	70	3	1
B&P&C	1	0	5	1	0	15
CG	41	1	11	34	0	17
LR	9	0	2	2	0	1
SC	9	0	1	1	0	6
SP	2	0	4	2	0	4
DP	76	2	2	53	1	4
GP	16	1	1	19	0	2
CP	82	0	6	47	0	4

B&P: Branch-and-Price, B&C: Branch-and-Cut, B&B: Branch-and-Bound, B&P&C: Branch-and-Price-and-Cut; CG: Column Generation, LR: Lagrangian Relaxation, SC: Set Covering, SP: Set Partitioning, DP: Dynamic Programming, GP: Goal Programming; CP: Constraint Programming.