Developing a Multimedia Product for the World Wide Web. - Linda Lisle; Scott Isensee; Jianming Dong (Designing Effective and Usable Multimedia Systems, 1998)

A Comparison of Two Current E-commerce Sites. - Roger Tilson; Jianming Dong; Shirley Martin; Eric Kieke (SIGDOC, 1998)

Designing menus for the Chinese population: Horizontal or vertical? - Jianming Dong; Gavriel Salvendy (Behav. Inf. Technol., 1999)

A user input and analysis tool for information architecture. - Jianming Dong; Shirley Martin; Paul Waldo (CHI Extended Abstracts, 2001)

Book Review: Paper prototyping-The fast and easy way to design and refine user interfaces, by Carolyn Snyder. - Jianming Dong (Int. J. Hum. Comput. Interact., 2004)

Getting the Most Out of Personas for Product Usability Enhancements. - Jianming Dong; Kuldeep Kelkar; Kelly Braun (HCI (10), 2007)

Streamlining Checkout Experience - A Case Study of Iterative Design of a China e-Commerce Site. - Alice Han; Jianming Dong; Winnie Tseng; Bernd Ewert (HCI (1), 2007)

Formal architectural models for agent-based service systems. - Zuohua Ding; Jianming Dong; Wei Han (Int. J. Comput. Appl. Technol., 2008)

Parallel Machine Scheduling with a Single Server: Loading and Unloading. - Jueliang Hu; Qinghui Zhang; Jianming Dong; Yiwei Jiang (COCOA, 2013)

Preemptive scheduling on two parallel machines with a single server. - Yiwei Jiang; Jianming Dong; Min Ji 001 (Comput. Ind. Eng., 2013)

Approximation algorithms for parallel open shop scheduling. - Yong Chen 002; An Zhang 001; Guangting Chen; Jianming Dong (Inf. Process. Lett., 2013)

A new three-machine shop scheduling: complexity and approximation algorithm. - Jianming Dong; Yong Chen 002; An Zhang 001; Qifan Yang (J. Comb. Optim., 2013)

Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. - Jianming Dong; An Zhang 001; Yong Chen 002; Qifan Yang (Theor. Comput. Sci., 2013)

An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop. - Jianming Dong; Yiwei Jiang; An Zhang 001; Jueliang Hu; Hui Luo (Inf. Process. Lett., 2015)

Single-server parallel-machine scheduling with loading and unloading times. - Yiwei Jiang; Qinghui Zhang; Jueliang Hu; Jianming Dong; Min Ji 001 (J. Comb. Optim., 2015)

An improved two-machine flowshop scheduling with intermediate transportation. - Jianming Dong; Xueshi Wang; Jueliang Hu; Guohui Lin (J. Comb. Optim., 2016)

A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines. - Jianming Dong; Jueliang Hu; Guohui Lin (Optim. Lett., 2016)

Machine scheduling with a maintenance interval and job delivery coordination. - Jueliang Hu; Taibo Luo; Xiaotong Su; Jianming Dong; Weitian Tong; Randy Goebel; Yinfeng Xu; Guohui Lin (Optim. Lett., 2016)

Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. - Jianming Dong; Jueliang Hu; Mikhail Y. Kovalyov; Guohui Lin; Taibo Luo; Weitian Tong; Xueshi Wang; Yinfeng Xu (Theor. Comput. Sci., 2017)

An FPTAS for the parallel two-stage flowshop problem. - Jianming Dong; Weitian Tong; Taibo Luo; Xueshi Wang; Jueliang Hu; Yinfeng Xu; Guohui Lin (Theor. Comput. Sci., 2017)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; An Zhang 001 (CoRR, 2018)

Single machine scheduling with job delivery to multiple customers. - Jianming Dong; Xueshi Wang; Jueliang Hu; Guohui Lin (J. Sched., 2018)

Seven HCI Grand Challenges. - Constantine Stephanidis; Gavriel Salvendy; Margherita Antona; Jessie Y. C. Chen; Jianming Dong; Vincent G. Duffy; Xiaowen Fang; Cali M. Fidopiastis; Gino Fragomeni; Limin Paul Fu; Yinni Guo; Don Harris; et al. (Int. J. Hum. Comput. Interact., 2019)

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. - Jianming Dong; Ruyan Jin; Jueliang Hu; Guohui Lin (J. Comb. Optim., 2019)

A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. - Jianming Dong; Ruyan Jin; Taibo Luo; Weitian Tong (Eur. J. Oper. Res., 2020)

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. - Jianming Dong; Joshua Chang; Bing Su 002; Jueliang Hu; Guohui Lin (J. Sched., 2020)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; Yao Xu; An Zhang 001 (Theor. Comput. Sci., 2020)

Minimizing total job completion time in MapReduce scheduling. - Jianming Dong; Randy Goebel; Jueliang Hu; Guohui Lin; Bing Su 002 (Comput. Ind. Eng., 2021)

No-wait two-stage flowshop problem with multi-task flexibility of the first machine. - Jianming Dong; Hong Pan; Cunkui Ye; Weitian Tong; Jueliang Hu (Inf. Sci., 2021)

Online early work scheduling on parallel machines. - Yiwei Jiang; Mengjing Wu; Xin Chen 057; Jianming Dong; T. C. E. Cheng; Jacek Blazewicz; Min Ji 001 (Eur. J. Oper. Res., 2024)

An efficient polynomial-time approximation scheme for parallel multi-stage open shops. - Jianming Dong; Ruyan Jin; Guohui Lin; Bing Su 002; Weitian Tong; Yao Xu (Discret. Appl. Math., 2025)