Research Article

Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms

Table 1

Studies with different approaches to SWDDA.

Studies Subjects or objectives

[16, 18, 2123, 2528, 30, 32, 46, 5356]Scheduling and common due date assignment
[13, 17, 19, 20, 24, 26, 31, 5759]Scheduling and separate due date assignment
[16, 20, 2330, 54]Single machine scheduling with due date assignment
[53]Two-machine flow shop scheduling with due date assignment
[18, 19, 22, 28, 46, 55, 56]Parallel machine scheduling with due date assignment
[13, 45, 59, 60]Multi-machine scheduling with due date assignment
[57, 58]Job shop scheduling with due date assignment
[20]Earliness Penalty
[31]Maximum Lateness
[31, 58]Total tardiness
[21, 27, 31, 54]E/T penalties
[61]Tardiness and due date related cost
[18, 22, 24, 26, 28, 45, 53, 55, 56, 62]Due-date related, E/T
[29]Due date, E/T, delivery cost
[30]Due date assignment, earliness and weighted number of tardy jobs
[60]Processing, E/T costs
[32]Resource consumption, E/T costs
[17, 21, 25, 31, 32]Weighted number of late jobs; Number of tardy jobs
[19]Minimize maximum absolute lateness
[23]Due date, absolute lateness and processing time reduction
[19, 57]PPW (Process Plus Wait)
[20, 30]SLK (Common Slack)
[57]TWK (Total work content)
[60]Different ready times