default search action
Jianming Dong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Yiwei Jiang, Mengjing Wu, Xin Chen
, Jianming Dong, T. C. E. Cheng
Online early work scheduling on parallel machines. Eur. J. Oper. Res. 315(3): 855-862 (2024) - 2022
- [i2]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR abs/2205.14407 (2022) - 2021
- [j22]Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su:
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158: 107387 (2021) - [j21]Jianming Dong
No-wait two-stage flowshop problem with multi-task flexibility of the first machine. Inf. Sci. 544: 25-38 (2021) - 2020
- [j20]Jianming Dong, Ruyan Jin, Taibo Luo, Weitian Tong
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. Eur. J. Oper. Res. 281(1): 16-24 (2020) - [j19]Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - [j18]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020)
2010 – 2019
- 2019
- [j17]Constantine Stephanidis
Seven HCI Grand Challenges. Int. J. Hum. Comput. Interact. 35(14): 1229-1269 (2019) - [j16]Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. J. Comb. Optim. 37(2): 668-684 (2019) - 2018
- [j15]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
Single machine scheduling with job delivery to multiple customers. J. Sched. 21(3): 337-348 (2018) - [i1]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018) - 2017
- [j14]Jianming Dong, Weitian Tong
An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657: 64-72 (2017) - [j13]Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687: 93-94 (2017) - 2016
- [j12]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31(3): 1316-1334 (2016) - [j11]Jianming Dong, Jueliang Hu, Guohui Lin:
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines. Optim. Lett. 10(1): 109-118 (2016) - [j10]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. 10(8): 1645-1656 (2016) - 2015
- [j9]Jianming Dong, Yiwei Jiang, An Zhang, Jueliang Hu, Hui Luo:
An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop. Inf. Process. Lett. 115(4): 475-480 (2015) - [j8]Yiwei Jiang, Qinghui Zhang, Jueliang Hu, Jianming Dong, Min Ji
Single-server parallel-machine scheduling with loading and unloading times. J. Comb. Optim. 30(2): 201-213 (2015) - [c7]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW 2015: 104-114 - 2013
- [j7]Yiwei Jiang, Jianming Dong, Min Ji
Preemptive scheduling on two parallel machines with a single server. Comput. Ind. Eng. 66(2): 514-518 (2013) - [j6]Yong Chen, An Zhang, Guangting Chen, Jianming Dong:
Approximation algorithms for parallel open shop scheduling. Inf. Process. Lett. 113(7): 220-224 (2013) - [j5]Jianming Dong, Yong Chen, An Zhang, Qifan Yang:
A new three-machine shop scheduling: complexity and approximation algorithm. J. Comb. Optim. 26(4): 799-810 (2013) - [j4]Jianming Dong, An Zhang, Yong Chen, Qifan Yang:
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. Theor. Comput. Sci. 491: 94-102 (2013) - [c6]Jueliang Hu, Qinghui Zhang, Jianming Dong, Yiwei Jiang:
Parallel Machine Scheduling with a Single Server: Loading and Unloading. COCOA 2013: 106-116
2000 – 2009
- 2008
- [j3]Zuohua Ding, Jianming Dong, Wei Han:
Formal architectural models for agent-based service systems. Int. J. Comput. Appl. Technol. 31(1/2): 45-63 (2008) - 2007
- [c5]Jianming Dong, Kuldeep Kelkar, Kelly Braun:
Getting the Most Out of Personas for Product Usability Enhancements. HCI (10) 2007: 291-296 - [c4]Alice Han, Jianming Dong, Winnie Tseng, Bernd Ewert:
Streamlining Checkout Experience - A Case Study of Iterative Design of a China e-Commerce Site. HCI (1) 2007: 796-801 - 2004
- [j2]Jianming Dong:
Book Review: Paper prototyping-The fast and easy way to design and refine user interfaces, by Carolyn Snyder. Int. J. Hum. Comput. Interact. 17(2): 287-288 (2004) - 2001
- [c3]Jianming Dong, Shirley Martin, Paul Waldo:
A user input and analysis tool for information architecture. CHI Extended Abstracts 2001: 23-24
1990 – 1999
- 1999
- [j1]Jianming Dong, Gavriel Salvendy:
Designing menus for the Chinese population: Horizontal or vertical? Behav. Inf. Technol. 18(6): 467-471 (1999) - 1998
- [c2]Linda Lisle, Scott Isensee, Jianming Dong:
Developing a Multimedia Product for the World Wide Web. Designing Effective and Usable Multimedia Systems 1998 - [c1]Roger Tilson, Jianming Dong, Shirley Martin, Eric Kieke:
A Comparison of Two Current E-commerce Sites. SIGDOC 1998: 87-92
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-10-07 21:13 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: