Similar Search Results

Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

Cheng, Mingbao; Tadikamalla, Pandu R.; Shang, Jennifer; … - In: European journal of operational research : EJOR 234 (2014) 3, pp. 650-657

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

A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Wang, Shijin; Liu, Ming; Chu, Chengbin - In: International journal of production research 53 (2015) 4, pp. 1143-1167

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

An enhanced branch-and-bound algorithm for the talent scheduling problem

Qin, Hu; Zhang, Zizhen; Lim, Andrew; Liang, Xiaocong - In: European journal of operational research : EJOR 250 (2016) 2, pp. 412-426

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

Exact methods for order acceptance and scheduling on unrelated parallel machines

Wang, Shijin; Ye, Benyan - In: Computers & operations research : and their … 104 (2019), pp. 159-173

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

A two-stage three-machine assembly scheduling problem with a position-based learning effect

Wu, Chin-Chia; Wang, Du-Juan; Cheng, Shuenn-Ren; Chung, … - In: International journal of production research 56 (2018) 9, pp. 3064-3079

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

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

Cordone, Roberto; Hosteins, Pierre - In: Computers & operations research : and their … 102 (2019), pp. 130-140

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

Improved approaches to the exact solution of the machine covering problem

Walter, Rico; Wirth, Martin; Lawrinenko, Alexander - In: Journal of scheduling 20 (2017) 2, pp. 147-164

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

A branching scheme based on First-Break-Then-Schedule decomposition

Briskorn, Dirk; Drexl, Andreas - 2007

Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. The goal is to find the minimum cost tournament among those having the minimum number of breaks. We pick up...

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

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Li, Chu-Min; Jiang, Hua; Manyà, Felip - In: Computers & operations research : and their … 84 (2017), pp. 1-15

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

Minimizing makespan on a single machine with release dates and inventory constraints

Davari, Morteza; Ranjbar, Mohammad; De Causmaecker, Patrick - 2018

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

A service of the

zbw