supported by the National Natural Science Foundation of China (Nos.62473186,62273221,and 52205529);Discipline with Strong Characteristics of Liaocheng University-Intelligent Science and Technology (No.319462208);Natural Science Foundation of Shandong Province (Nos.ZR2021QF036 and ZR2021QE195).
The lot-streaming flowshop scheduling problem with equal-size sublots(ELFSP)is a significant extension of the classic flowshop scheduling problem,focusing on optimize makespan.In response,an improved dynamic Q-learnin...
This work is partially supported by the National Natural Science Foundation of China(Grant Nos.61803192,61966012,61973203,and 62106073);Guangyue Young Scholar Innovation Team of Liaocheng University(Grant No.LCUGYTD2022-03);the Youth Innovation Talent Introduction and Education Program support from Shandong Province Colleges and Universities,the Natural Science Foundation of Hunan Province(Grant No.2021JJ40116);the Natural Science Foundation of Shandong Province(Grant Nos.ZR2021QE195 and ZR2021QF036).
Given that group technology can reduce the changeover time of equipment,broaden the productivity,and enhance the flexibility of manufacturing,especially cellular manufacturing,group scheduling problems(GSPs)have elici...
In this paper,we consider the problem of minimizing the total tardiness in a deterministic two-machine permutationflowshop scheduling problem subject to release dates of jobs and known unavailability periods of machin...
Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a va...
Due to the fourth revolution experiencing,referred to as Industry 4.0,many production firms are devoted to integrating new technological tools to their manufacturing process.One of them,is rescheduling the tasks on th...
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been inves...
This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, m...
supported by National Natural Science Foundation of China (Grant Nos. 60973085, 61174187);National Hi-tech Research and Development Program of China (863 Program, Grant No. 2009AA044601);New Century Excellent Talents in University of China (Grant No. NCET-08-0232)
Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a numb...