Narrow search
Showing 71 - 80 of 751,142
Cover Image
Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect : a case study from wax production
Rostami, Mohammad; Nikravesh, Shiva; Shahin, Mahdi - In: Operational research : an international journal 20 (2020) 3, pp. 1255-1287
Persistent link: https://www.econbiz.de/10012291156
Cover Image
A machine learning-based selection approach for solving the single machine scheduling problem with Early/Tardy jobs
Abdessemed, Ahmed-Adnane; Mouss, Leila Hayet; … - In: Bizinfo (Blace) : časopis iz oblasti ekonomije … 15 (2024) 1, pp. 1-10
Persistent link: https://www.econbiz.de/10014635216
Cover Image
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak; Benmansour, Rachid; Zufferey, Nicolas - In: 4OR : quarterly journal of the Belgian, French and … 22 (2024) 3, pp. 351-385
Persistent link: https://www.econbiz.de/10015071756
Cover Image
Heuristics and lower bounds for the simple assembly line balancing problem type 1 : overview, computational tests and improvements
Pape, Tom - In: European journal of operational research : EJOR 240 (2015) 1, pp. 32-42
Persistent link: https://www.econbiz.de/10010491516
Cover Image
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Srirangacharyulu, B.; Srinivasan, G. - In: European journal of operational research : EJOR 231 (2013) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10009787396
Cover Image
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180
Persistent link: https://www.econbiz.de/10011848225
Cover Image
A new approximation algorithm for unrelated parallel machine scheduling with release dates
Pei, Zhi; Wan, Mingzhong; Wang, Ziteng - In: Project management and scheduling, (pp. 397-425). 2020
Persistent link: https://www.econbiz.de/10012157366
Cover Image
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan - In: European journal of operational research : EJOR 297 (2022) 1, pp. 27-39
Persistent link: https://www.econbiz.de/10013258540
Cover Image
Optimal placement of detectors to minimize casualties in an intentional attack
Marufuzamman, Mohammad; Aghalari, Amin; Buchanan, Randy K. - In: IEEE transactions on engineering management : EM 69 (2022) 6,2, pp. 3994-4005
Persistent link: https://www.econbiz.de/10013548816
Cover Image
An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem
Russo, Mauro; Sforza, Antonio; Sterle, Claudio - In: International journal of production economics 145 (2013) 2, pp. 451-462
Persistent link: https://www.econbiz.de/10010187910