Similar Search Results

Novel model and solution method for flexible job shop scheduling problem with batch processing machines

Ji, Bin; Zhang, Shujing; Yu, Samson S.; Xiao, Xin; … - In: Computers & operations research : an international journal 161 (2024), pp. 1-17

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

Improved approximation algorithms for k-submodular maximization under a knapsack constraint

Ha, Dung T. K.; Pham, Canh V.; Tran, Tan D. - In: Computers & operations research : an international journal 161 (2024), pp. 1-14

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

Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm

Usman, Shaban; Lu, Cong - In: Computers & operations research : an international journal 162 (2024), pp. 1-20

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

Capacitated planned maintenance : models, optimization algorithms, combinatorial and polyhedral properties

Kuschel, Torben - 2017

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

Computational probability : algorithms and applications in the mathematical sciences

Drew, John H.; Evans, Diane L.; Glen, Andrew G.; … - 2017 - Second edition

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

Identical parallel machine scheduling problems : structural patterns, bounding techniques and solution procedures

Lawrinenko, Alexander - 2017

The work is about fundamental parallel machine scheduling problems which occur in manufacturing systems where a set of jobs with individual processing times has to be assigned to a set of machines with respect to several workload objective functions like makespan minimization, machine covering...

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