Peihai Liu

Orcid: 0000-0002-3963-1526

Affiliations:
  • East China University of Science and Technology, Shanghai, China


According to our database1, Peihai Liu authored at least 17 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Two-agent scheduling in a two-machine open shop.
Ann. Oper. Res., February, 2024

2023
Two-agent single-machine scheduling with release dates to minimize the makespan.
Optim. Lett., November, 2023

Vehicle scheduling problems with two agents on a line.
J. Comb. Optim., 2023

2020
New approximation algorithms for machine scheduling with rejection on single and parallel machine.
J. Comb. Optim., 2020

2019
A note on minimizing total weighted completion time with an unexpected machine unavailable interval.
J. Sched., 2019

Two-agent scheduling on a single machine with release dates.
Comput. Oper. Res., 2019

2015
Integrated scheduling of production and delivery on a single machine with availability constraint.
Theor. Comput. Sci., 2015

Online scheduling on two parallel machines with release dates and delivery times.
J. Comb. Optim., 2015

Online unbounded batch scheduling on parallel machines with delivery times.
J. Comb. Optim., 2015

2014
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan.
Comput. Oper. Res., 2014

2013
Online Algorithms for Batch Machines Scheduling with Delivery Times.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Online Scheduling on Two Parallel Machines with Release Times and Delivery Times.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines.
J. Sched., 2012

2011
An improved approximation algorithm for single machine scheduling with job delivery.
Theor. Comput. Sci., 2011

Online batch scheduling on parallel machines with delivery times.
Theor. Comput. Sci., 2011

Optimal on-line algorithms for one batch machine with grouped processing times.
J. Comb. Optim., 2011

2009
On-line scheduling of parallel machines to minimize total completion times.
Comput. Oper. Res., 2009


  Loading...