Narrow search
Showing 1 - 10 of 627,233
Cover Image
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
Xu, Kailiang; Feng, Zuren; Jun, Keliang - In: Computers & operations research : and their … 37 (2010) 11, pp. 1924-1938
Persistent link: https://www.econbiz.de/10003990146
Cover Image
An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Panwalkar, S. S.; Koulamas, Christos - In: European journal of operational research : EJOR 221 (2012) 1, pp. 7-13
Persistent link: https://www.econbiz.de/10009553176
Cover Image
A hybrid PSO-GA algorithm for job shop scheduling in machine tool production
Liu, Li-Lan; Hu, Rong-Song; Hu, Xiang-Ping; Zhao, Gai-Ping - In: International journal of production research 53 (2015) 19, pp. 5755-5781
Persistent link: https://www.econbiz.de/10011420802
Cover Image
An exact algorithm for the single machine problem with unavailability periods
Gharbi, Anis; Labidi, Mohamed; Haouari, Mohamed - In: European journal of industrial engineering : EJIE 9 (2015) 2, pp. 244-260
Persistent link: https://www.econbiz.de/10011503609
Cover Image
Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns
Xiong, Jian; Xing, Li-ning; Chen, Ying-wu - In: International journal of production economics 141 (2013) 1, pp. 112-126
Persistent link: https://www.econbiz.de/10009685685
Cover Image
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü; Agi, Maher A. N.; Guérin, Jérémy - In: International journal of production research 59 (2021) 2, pp. 617-634
Persistent link: https://www.econbiz.de/10012425198
Cover Image
Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem
Yamashiro, Hirochika; Nonaka, Hirofumi - In: Operations research perspectives 8 (2021), pp. 1-9
Light gradient-boosted machine (LightGBM) algorithm and Ridge performed the best with MAPE and RMSE. The optimization of …
Persistent link: https://www.econbiz.de/10012596666
Cover Image
Scheduling to Minimize Average Completion Time Revisited : Deterministic On-Line Algorithms
Megow, Nicole; Schulz, Andreas S. - 2003
-line algorithms, which are (4+epsilon)-competitive in either case. Our preemptive algorithm is 2-competitive, which actually meets the … competitive ratio of the currently best randomized on-line algorithm for this scenario. Our nonpreemptive algorithm has a … competitive ratio of 3.28. Both results are characterized by a surprisingly simple analysis; moreover, the preemptive algorithm …
Persistent link: https://www.econbiz.de/10014029736
Cover Image
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, Krzysztof; Pecyna, Tomasz; Slysz, Mateusz; … - In: European journal of operational research : EJOR 310 (2023) 2, pp. 518-528
Persistent link: https://www.econbiz.de/10014340226
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