Qiulan Zhao

Orcid: 0000-0002-7931-6176

According to our database1, Qiulan Zhao authored at least 21 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A note on multi-agent scheduling to minimize the total weighted number of tardy jobs.
Oper. Res. Lett., 2026

Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines.
Eur. J. Oper. Res., 2026

2024
Single-machine primary-secondary scheduling with total tardiness being the primary criterion.
J. Sched., June, 2024

Packing Feedback Arc Sets in Tournaments Exactly.
Math. Oper. Res., 2024

2022
Interactions of localized wave and dynamics analysis in generalized derivative nonlinear Schrödinger equation.
Commun. Nonlinear Sci. Numer. Simul., 2022

Dynamics analysis for the Wadati-Konno-Ichikawa(II)-short pulse equation.
Appl. Math. Lett., 2022

2021
Scheduling to tradeoff between the number and the length of accepted jobs.
Theor. Comput. Sci., 2021

2020
Ranking tournaments with no errors II: Minimax relation.
J. Comb. Theory B, 2020

Ranking tournaments with no errors I: Structural description.
J. Comb. Theory B, 2020

Bicriteria scheduling of equal length jobs on uniform parallel machines.
J. Comb. Optim., 2020

Co-density and fractional edge cover packing.
J. Comb. Optim., 2020

Integrable asymmetric AKNS model with multi-component.
Commun. Nonlinear Sci. Numer. Simul., 2020

2019
Densities, Matchings, and Fractional Edge-Colorings.
SIAM J. Optim., 2019

A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine.
Oper. Res. Lett., 2019

Explicit Solutions and Conservation Laws for a New Integrable Lattice Hierarchy.
Complex., 2019

Explicit solutions to a coupled integrable lattice equation.
Appl. Math. Lett., 2019

2018
On box-perfect graphs.
J. Comb. Theory B, 2018

2017
Ranking tournaments with no errors.
PhD thesis, 2017

Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs.
Asia Pac. J. Oper. Res., 2017

2016
Rescheduling with new orders and general maximum allowable time disruptions.
4OR, 2016

2013
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption.
J. Sched., 2013


  Loading...