Similar Search Results

A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Arnaout, Jean-Paul - In: Project management and scheduling, (pp. 273-293). 2020

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

Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines

Alhadi, Gais; Kacem, Imed; Laroche, Pierre; Osman, … - In: Project management and scheduling, (pp. 369-395). 2020

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

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

Shortest path tour problem with time windows

Di Puglia Pugliese, Luigi; Ferone, Daniele; Festa, Paola; … - In: European journal of operational research : EJOR 282 (2020) 1, pp. 334-344

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

Machine scheduling with soft precedence constraints

Zhang, An; Qi, Xiangtong; Li, Guanhua - In: European journal of operational research : EJOR 282 (2020) 2, pp. 491-505

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

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming

Fischetti, Matteo; Monaci, Michele - In: European journal of operational research : EJOR 282 (2020) 2, pp. 506-514

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

Online fractional hierarchical scheduling on uniformly related machines

Liu, Zhaohui; Zhan, Jiyuan - In: Computers & operations research : and their … 113 (2020), pp. 1-8

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

Algorithm for situation-dependent adaptation of velocity for shuttle based systems

Kriehn, Thomas; Schloz, Franziska; Schulz, Robert; … - In: Artificial intelligence and digital transformation in …, (pp. 223-264). 2019

due to scheduled inbound deliveries. This article presents and discusses an algorithm that is based on closed … awaiting orders requires an algorithm which needs to be implemented in the control of the SBS/RS. A simulation model of a SBS … energy requirement. Findings: The results of this paper is the quantified energy saving by the application of the algorithm …

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

Algorithmic pricing what implications for competition policy?

Calvano, Emilio; Calzolari, Giacomo; Denicolò, Vincenzo; … - In: Review of industrial organization : RIO 55 (2019) 1, pp. 155-171

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

Popular matchings in complete graphs

Cseh, Ágnes; Kavitha, Telikepalli - 2020

Our input is a complete graph G on n vertices where each vertex has a strictranking of all other vertices in G. The goal is to construct a matching in G that is "globallystable" or popular. A matching M is popular if M does not lose a head-to-head election againstany matching M': here each...

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