Similar Search Results

Optimal rules for central bank interest rates subject to zero lower bound

Singh, Ajay Pratap; Nikolaou, Michael - In: Economics - The Open-Access, Open-Assessment E-Journal 8 (2014), pp. 1-67

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/10010961608

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

Makespan minimization on a two-machine flowshop with an availability constraint on the first machine

Hnaien, Faicel; Yalaoui, Farouk; Mhadhbi, Ahmed - In: International journal of production economics 164 (2015), pp. 95-104

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

Exact algorithms for the solution of the grey pattern quadratic assignment problem

Drezner, Zvi; Misevic̆ius, Alfonsas; Palubeckis, Gintaras - In: Mathematical methods of operations research 82 (2015) 1, pp. 85-105

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

How important are branching decisions : fooling MIP solvers

Le Bodic, Pierre; Nemhauser, George L. - In: Operations research letters 43 (2015) 3, pp. 273-278

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

A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

Moukrim, Aziz; Rebaine, Djamal; Serairi, Mehdi - In: RAIRO / Operations research 48 (2014) 2, pp. 235-254

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

Parallel machine scheduling with limited controllable machine availability

Dong, Ming - In: International journal of production research 51 (2013) 8, pp. 2240-2252

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

An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems

Yoon, K.; Ahn, Suck-kyo; Kang, M. - In: International journal of production research 51 (2013) 6, pp. 1680-1693

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

Minimizing maximum lateness of jobs in inventory constrained scheduling

Brikskorn, Dirk; Leung, J. Y.-T. - In: Journal of the Operational Research Society : OR 64 (2013) 12, pp. 1851-1864

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

A binary branch and bound algorithm to minimize maximum scheduling cost

Chandra, Charu; Liu, Zhixin; He, Jun; Ruohonen, Toni - In: Omega : the international journal of management science 42 (2014), pp. 9-15

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