Narrow search
Showing 1 - 10 of 18,232
Cover Image
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Ozturk, Onur; Begen, Mehmet A.; Zaric, Gregory S. - In: International journal of production research 55 (2017) 5/6, pp. 1815-1831
Persistent link: https://www.econbiz.de/10011628422
Cover Image
The two-machine flowshop total completion time problem : branch-and-bound algorithms based on network-flow formulation
Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji - In: European journal of operational research : EJOR 252 (2016) 3, pp. 750-760
Persistent link: https://www.econbiz.de/10011472309
Cover Image
A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
Yao, Shiqing; Jiang, Zhibin; Li, Na - In: Computers & operations research : and their … 39 (2012) 5, pp. 939-951
Persistent link: https://www.econbiz.de/10010217415
Cover Image
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Gmys, Jan; Mezmaz, Mohand; Melab, Nouredine; Tuyttens, … - In: European journal of operational research : EJOR 284 (2020) 3, pp. 814-833
Persistent link: https://www.econbiz.de/10012238910
Cover Image
A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
Toksari, M. Duran - In: RAIRO / Operations research 50 (2016) 1, pp. 211-219
Persistent link: https://www.econbiz.de/10011641518
Cover Image
A two-stage three-machine assembly scheduling problem with deterioration effect
Wu, Chin-Chia; Azzouz, Ameni; Chung, I. Hong; Lin, Win-Chin - In: International journal of production research 57 (2019) 21, pp. 6634-6647
Persistent link: https://www.econbiz.de/10012193771
Cover Image
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza; Ranjbar, Mohammad; De Causmaecker, Patrick - In: European journal of operational research : EJOR 286 (2020) 1, pp. 115-128
Persistent link: https://www.econbiz.de/10012239901
Cover Image
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Srirangacharyulu, B.; Srinivasan, G. - In: European journal of operational research : EJOR 231 (2013) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10009787396
Cover Image
Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times
Luo, JianChao; Liu, ZhiQiang; Xing, Keyi - In: International journal of production research 57 (2019) 5, pp. 1398-1412
Persistent link: https://www.econbiz.de/10012183815
Cover Image
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel - In: Journal of combinatorial optimization 24 (2012) 3, pp. 347-373
Persistent link: https://www.econbiz.de/10009657496