Dynamic seru order acceptance and scheduling with periodic worker assignment Online publication date: Mon, 22-Aug-2022
by Lili Wang; Zhe Zhang; Yong Yin
International Journal of Manufacturing Research (IJMR), Vol. 17, No. 2, 2022
Abstract: In this paper, we examine the dynamic seru order acceptance and scheduling problem with periodic worker assignment. To deal with the dynamic order arrival environment, a periodic dynamic adjustment strategy combined the technology of rolling window will be adopted. In other words, we periodically accept, schedule the coming orders and reassign workers in a periodic manner to decompose the dynamic problem into a series of continuous static sub-problems to maximise total net revenue. At the same time, an extended bi-level chromosome coding genetic algorithm combining order acceptance and scheduling results with worker assignment is designed which automatically constructs reactive adjustment strategy for the dynamic order acceptance and scheduling with worker assignment. In the end, the experimental results show that the improved genetic algorithm with rolling window technology (IGA-RWT) is feasible and effective. [Submitted 17 April 2020; Accepted 4 August 2020]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook