Narrow search
Showing 1 - 10 of 543
Cover Image
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem
Dell'Amico, Mauro; Jamal, Jafar; Montemanni, Roberto - In: Computers & operations research : and their … 156 (2023), pp. 1-9
Persistent link: https://www.econbiz.de/10014373676
Cover Image
Rebalancing the assembly lines : exact solution approaches
Sancı, Ece; Azizoğlu, Meral - In: International journal of production research 55 (2017) 19/20, pp. 5991-6010
Persistent link: https://www.econbiz.de/10011724329
Cover Image
Minimising the makespan in the two-machine job shop problem under availability constraints
Benttaleb, Mourad; Hnaien, Faicel; Yalaoui, Farouk - In: International journal of production research 57 (2019) 5, pp. 1427-1457
Persistent link: https://www.econbiz.de/10012183817
Cover Image
A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling
Pei, Zhi; Zhang, Xuefang; Zheng, Li; Wan, Mingzhong - In: International journal of production research 58 (2020) 2, pp. 487-508
Persistent link: https://www.econbiz.de/10012193974
Cover Image
Optimal rules for central bank interest rates subject to zero lower bound
Singh, Ajay Pratap; Nikolaou, Michael - 2014
The celebrated Taylor rule provides a simple formula that aims to capture how the central bank interest rate is adjusted as a linear function of inflation and output gap. However, the rule does not take explicitly into account the zero lower bound on the interest rate. Prior studies on interest...
Persistent link: https://www.econbiz.de/10010425057
Cover Image
Optimal rules for central bank interest rates subject to zero lower bound
Singh, Ajay Pratap; Nikolaou, Michael - 2013
The celebrated Taylor rule provides a simple formula that aims to capture how the central bank interest rate is adjusted as a linear function of inflation and output gap. However, the rule does not take explicitly into account the zero lower bound on the interest rate. Prior studies on interest...
Persistent link: https://www.econbiz.de/10010126729
Cover Image
Min max min robust (relative) regret combinatorial optimization
Crema, Alejandro - In: Mathematical methods of operations research : ZOR 92 (2020) 2, pp. 249-283
Persistent link: https://www.econbiz.de/10012395564
Cover Image
A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Lee, Ju-Yong; Kim, Yeong-Dae - In: Journal of the Operational Research Society : OR 66 (2015) 9, pp. 1542-1554
Persistent link: https://www.econbiz.de/10011417478
Cover Image
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda; Benson, Harold P.; Erenguc, Selcuk - In: International journal of production research 54 (2016) 13/14, pp. 3943-3961
Persistent link: https://www.econbiz.de/10011508452
Cover Image
Exact algorithms for single-machine scheduling with time windows and precedence constraints
Davari, Morteza; Demeulemeester, Erik; Leus, Roel; … - In: Journal of scheduling 19 (2016) 3, pp. 309-334
Persistent link: https://www.econbiz.de/10011509149