# Search results for: Jinjiang Yuan

Future Generation Computer Systems > 2017 > 76 > Complete > 293-300

Discrete Optimization > 2017 > 25 > Complete > 105-119

Journal of Combinatorial Optimization > 2017 > 34 > 4 > 1187-1197

Journal of Combinatorial Optimization > 2017 > 34 > 2 > 483-503

Journal of Combinatorial Optimization > 2017 > 34 > 2 > 433-440

Journal of Scheduling > 2017 > 20 > 2 > 211-218

Lecture Notes in Computer Science > Cryptology and Network Security > Boolean Functions and Stream Ciphers > 259-269

*m*is possibly larger than the largest divisor of

*n*. Meanwhile we prove that there exists a perfect nonlinear function from...

Theoretical Computer Science > 2016 > 622 > Complete > 45-65

Theoretical Computer Science > 2016 > 617 > Complete > 65-68

Applied Mathematics and Computation > 2016 > 273 > Complete > 912-923

Applied Mathematics and Computation > 2016 > 273 > Complete > 570-583

OR Spectrum > 2016 > 38 > 2 > 519-529

Optimization Letters > 2016 > 10 > 1 > 159-168

Operations Research Letters > 2016 > 44 > 1 > 92-95

Journal of Combinatorial Optimization > 2016 > 32 > 2 > 385-395

*n*independent jobs arrive online over time. Each job $$J_{j}$$ J j has a release date $$r_{j}$$ r j , a processing time $$p_{j}$$ p j and a delivery time $$q_{j}$$ q j . The characteristics of a job are unknown until it arrives. The goal is to find a schedule...

Journal of Combinatorial Optimization > 2016 > 31 > 4 > 1609-1622

Information Processing Letters > 2015 > 115 > 12 > 969-974

Discrete Applied Mathematics > 2015 > 189 > Complete > 49-52