Rong-Rong Mao
Rong-Rong Mao
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Rong-Rong Mao has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Dan-Yang Lv
School of Mechatronics Engineering, Shenyang Aerospace University, Shenyang 110136, China
1 shared publication - Ji-Bo Wang
Shenyang Aerospace University
1 shared publication - Yi-Chun Wang
School of Science, Shenyang Aerospace University, Shenyang 110136, China
1 shared publication - Yuan-Yuan Lu
College of Mathematics and Computer, Jilin Normal University, Siping 136000, China
1 shared publication
Latest Publications
- Open Access
- 19 September 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (18) , 3983
Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments
In practical problems, in addition to the processing time of the job, the impact of the time required for delivering the service to customers on the cost is also considered, i.e., delivery time, where the job processing time is a simple linear function of its starting time. This paper considers the impact of past-sequence-dependent delivery times (which can be referred to as ) on the studied objectives in three types of due windows (common, slack and different due windows). This serves to minimize the weighted sum of earliness, tardiness, starting time and size of due window, where the weights (coefficients) are related to the location. Through the theoretical analysis of the optimal solution, it is found that these three problems can be solved in time , respectively, where N is the number of jobs.- 19 September 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (18) , 3983
Open AccessDelivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments
In practical problems, in addition to the processing time of the job, the impact of the time required for delivering the service to customers on the cost is also considered, i.e., delivery time, where the job processing time is a simple linear function of its starting time. This paper considers the impact of past-sequence-dependent delivery times (which can be referred to as ) on the studied objectives in three types of due windows (common, slack and different due windows). This serves to minimize the weighted sum of earliness, tardiness, starting time and size of due window, where the weights (coefficients) are related to the location. Through the theoretical analysis of the optimal solution, it is found that these three problems can be solved in time , respectively, where N is the number of jobs.