Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeihai Liu
Person information
- affiliation: East China University of Science and Technology, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Peihai Liu, Manzhan Gu
, Xiwen Lu:
Two-agent scheduling in a two-machine open shop. Ann. Oper. Res. 333(1): 275-301 (2024)- 2023
- [j14]Hao Yan, Peihai Liu, Xiwen Lu:
Vehicle scheduling problems with two agents on a line. J. Comb. Optim. 45(1): 10 (2023) - [j13]Jin Yu, Peihai Liu, Xiwen Lu:
Two-agent single-machine scheduling with release dates to minimize the makespan. Optim. Lett. 17(8): 1915-1937 (2023) - 2020
- [j12]Peihai Liu, Xiwen Lu:
New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4): 929-952 (2020) - 2019
- [j11]Peihai Liu, Manzhan Gu, Ganggang Li:
Two-agent scheduling on a single machine with release dates. Comput. Oper. Res. 111: 35-42 (2019) - [j10]Peihai Liu, Chao Wang, Xiwen Lu:
A note on minimizing total weighted completion time with an unexpected machine unavailable interval. J. Sched. 22(2): 255-262 (2019) - 2015
- [j9]Peihai Liu, Xiwen Lu:
Online unbounded batch scheduling on parallel machines with delivery times. J. Comb. Optim. 29(1): 228-236 (2015) - [j8]Peihai Liu, Xiwen Lu:
Online scheduling on two parallel machines with release dates and delivery times. J. Comb. Optim. 30(2): 347-359 (2015) - [j7]Jing Fan, Xiwen Lu, Peihai Liu:
Integrated scheduling of production and delivery on a single machine with availability constraint. Theor. Comput. Sci. 562: 581-589 (2015) - 2014
- [j6]Peihai Liu, Xiwen Lu:
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan. Comput. Oper. Res. 51: 251-256 (2014) - 2012
- [j5]Peihai Liu, Xiwen Lu, Yang Fang:
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. J. Sched. 15(1): 77-81 (2012) - 2011
- [j4]Yang Fang, Peihai Liu, Xiwen Lu:
Optimal on-line algorithms for one batch machine with grouped processing times. J. Comb. Optim. 22(4): 509-516 (2011) - [j3]Peihai Liu, Xiwen Lu:
An improved approximation algorithm for single machine scheduling with job delivery. Theor. Comput. Sci. 412(3): 270-274 (2011) - [j2]Yang Fang, Xiwen Lu, Peihai Liu:
Online batch scheduling on parallel machines with delivery times. Theor. Comput. Sci. 412(39): 5333-5339 (2011) - 2009
- [j1]Peihai Liu, Xiwen Lu:
On-line scheduling of parallel machines to minimize total completion times. Comput. Oper. Res. 36(9): 2647-2652 (2009)
Conference and Workshop Papers
- 2013
- [c2]Peihai Liu, Xiwen Lu:
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times. COCOA 2013: 96-105 - [c1]Peihai Liu, Xiwen Lu:
Online Algorithms for Batch Machines Scheduling with Delivery Times. COCOON 2013: 114-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
