Similar Search Results

Flow shop scheduling with jobs arriving at different times

Li, Guo; Li, Na; Sambandam, Narayanasamy; Sethi, Suresh P. - In: International journal of production economics 206 (2018), pp. 250-260

Persistent link: https://www.econbiz.de/10011948383

Semiconductor final test scheduling with Sarsa(λ, k) algorithm

Zhang, Zhicong; Zheng, Li; Hou, Forest; Li, Na - In: European journal of operational research : EJOR 215 (2011) 2, pp. 446-458

Persistent link: https://www.econbiz.de/10009302759

Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Zhang, Zhicong; Zheng, Li; Li, Na; Wang, Weiping; … - In: Computers & operations research : and their … 39 (2012) 7, pp. 1315-1324

Persistent link: https://www.econbiz.de/10009408366

A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

Yao, Shiqing; Jiang, Zhibin; Li, Na - In: Computers & operations research : and their … 39 (2012) 5, pp. 939-951

Persistent link: https://www.econbiz.de/10010217415

Flow Shop Scheduling With Jobs Arriving at Different Times

Li, Guo - 2020

Flow shop scheduling is common in modern lean production systems. In practice, jobs in flow shops can arrive at irregular times. However, scheduling that considers such irregularity has not been adequately investigated in the literature. In this paper, we examine the scheduling of n-jobs in an...

Persistent link: https://www.econbiz.de/10012838801