Scheduling controllable processing time jobs in seru production system with resource allocation

Abstract

In this article, four scheduling problems with controllable processing times and resource allocation in seru production system (SPS) are first studied. The objective is to minimize the total processing cost plus scheduling measures, which are the total waiting time, the total absolute differences in completion times, the total absolute differences in waiting times and the total earliness and tardiness, respectively. A general exact solution method is proposed to show that these four problems can be transformed into assignment problems and solved in polynomial time if the number of serus and processing times are given in advance. Computational experiments are made finally, and results indicate that the exact solution method is effective to return optimal schedules for four seru scheduling problems. Further, the schedule flexibility of SPS can be enhanced by considering controllable processing times, and workload balance is also need to be concern in seru production practice.

Keywords:

• Scheduling
• seru production system
• production scheduling
• controllable processing times
• resource allocation

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was sponsored by National Natural Science Foundation of China (Grant No. 71401075, 71801129), Natural Science Foundation of Jiangsu Province (Grant No. BK20180452), and Fundamental Research Funds for the Central Universities (Grant No. 30920010021). We would like to give our great appreciation to all the reviewers and editors who contributed this research.