default search action
Jen-Ya Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Yu-Chuan Chen, Jen-Ya Wang
:
A Lower Bound for Minimizing Waiting Time in Coexisting Virtual and Physical Worlds. IEEE Access 12: 73470-73480 (2024) - [j25]Lie-Fen Lin
Lower bounds for minimizing two types of unnecessary costs in the film and television industry. Comput. Oper. Res. 170: 106759 (2024) - 2022
- [j24]Chung-Ho Su, Jen-Ya Wang
A makespan minimization problem for versatile developers in the game industry. RAIRO Oper. Res. 56(6): 3895-3913 (2022) - 2020
- [j23]Jen-Ya Wang
Minimizing the Total Tardiness of a Game Project Considering the Overlap Effect. IEEE Access 8: 216507-216518 (2020) - [j22]Jen-Ya Wang
Minimizing the total weighted tardiness of overlapping jobs on parallel machines with a learning effect. J. Oper. Res. Soc. 71(6): 910-927 (2020) - [j21]Wen-Chiung Lee, Jen-Ya Wang
A three-agent scheduling problem for minimizing the flow time on two machines. RAIRO Oper. Res. 54(2): 307-323 (2020)
2010 – 2019
- 2019
- [j20]Jen-Ya Wang
A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of a Three-Agent Scheduling Problem Considering the Overlap Effect and Environmental Protection. IEEE Access 7: 5106-5123 (2019) - [j19]Jen-Ya Wang
Algorithms for Minimizing Resource Consumption Over Multiple Machines With a Common Due Window. IEEE Access 7: 172136-172151 (2019) - [j18]Kuen-Fang Jea, Jen-Ya Wang, Chih-Wei Hsu:
Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit. Asia Pac. J. Oper. Res. 36(3): 1950014:1-1950014:24 (2019) - 2018
- [c9]Wen-Chiung Lee, Jen-Ya Wang:
Minimizing the Total Weighted Completion Time for Three Cooperating Agents. IIAI-AAI 2018: 618-621 - 2017
- [j17]Wen-Chiung Lee, Jen-Ya Wang:
A three-agent scheduling problem for minimizing the makespan on a single machine. Comput. Ind. Eng. 106: 147-160 (2017) - [c8]Wen-Chiung Lee, Jen-Ya Wang:
A Three-Agent Flow Shop Problem for Minimizing the Total Completion Time. IIAI-AAI 2017: 825-828 - 2016
- [j16]Zhaohui Liu, Wen-Chiung Lee, Jen-Ya Wang
Resource consumption minimization with a constraint of maximum tardiness on parallel machines. Comput. Ind. Eng. 97: 191-201 (2016) - [j15]Chia-Huang Wu
Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects. Discret. Optim. 19: 1-11 (2016) - [j14]Yau-Ren Shiau, Wen-Chiung Lee, Yu-Sheng Kung, Jen-Ya Wang
A lower bound for minimizing the total completion time of a three-agent scheduling problem. Inf. Sci. 340-341: 305-320 (2016) - [j13]Wen-Chiung Lee, Jen-Ya Wang
A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowl. Based Syst. 105: 68-82 (2016) - [j12]Jen-Ya Wang
Minimizing the Average Waiting Time of Unequal-Size Data Items in a Mobile Computing Environment. Mob. Inf. Syst. 2016: 9371563:1-9371563:14 (2016) - [c7]Jen-Ya Wang, Fuh-Gwo Chen, David Wen-Shung Tai, Jr-Shian Chen:
An Automatic Test Generator for Enhancing the Technolgy Profciency of Senior High School Students. IIAI-AAI 2016: 273-276 - [c6]Jr-Shian Chen, Jen-Ya Wang, Fuh-Gwo Chen, David Wen-Shung Tai:
Applying Fuzzy Delphi Method to Construct Digital Literacy Competences for Senior High School Students. IIAI-AAI 2016: 277-280 - [c5]Wen-Chiung Lee, Jen-Ya Wang:
A Three-Agent Scheduling Problem for Minimizing the Total Tardiness on a Single Machine. IIAI-AAI 2016: 664-668 - 2015
- [j11]Wen-Chiung Lee, Jen-Ya Wang, Hsin-Wei Su:
Algorithms for single-machine scheduling to minimize the total tardiness with learning effects and two competing agents. Concurr. Eng. Res. Appl. 23(1): 13-26 (2015) - [j10]Wen-Chiung Lee, Jen-Ya Wang
A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity. J. Oper. Res. Soc. 66(11): 1906-1918 (2015) - [c4]Fuh-Gwo Chen, Jen-Ya Wang, Jr-Shian Chen, Sheng-Chung Tu, Kuo-Yi Chen:
A Hang-and-Play Intravenous Infusion Monitoring System. ACIT-CSI 2015: 278-281 - 2014
- [j9]Wen-Chiung Lee, Jen-Ya Wang
A scheduling problem with three competing agents. Comput. Oper. Res. 51: 208-217 (2014) - 2013
- [j8]Jen-Ya Wang, Fuh-Gwo Chen, Jr-Shian Chen:
A green pump scheduling algorithm for minimizing power consumption and land depletion. Concurr. Eng. Res. Appl. 21(2): 121-128 (2013) - [j7]Min Ji
Minimizing resource consumption on uniform parallel machines with a bound on makespan. Comput. Oper. Res. 40(12): 2970-2974 (2013) - [j6]Jen-Ya Wang, Jr-Shian Chen:
A Data Partition Method for MEMS-Based Storage Devices in a Distributed Computing Environment. Int. J. Softw. Eng. Knowl. Eng. 23(1): 101-116 (2013) - [c3]Jen-Ya Wang, Yu-Han Shih, Jr-Shian Chen:
Algorithms for Batch Scheduling to Maximize the Learning Profit with Learning Effect and Two Competing Agents. ITCS 2013: 445-450 - 2012
- [j5]Jen-Ya Wang:
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries. Int. J. Grid High Perform. Comput. 4(4): 52-67 (2012) - [j4]Jen-Ya Wang:
Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments. Inf. Sci. 199: 93-108 (2012) - [c2]Jr-Shian Chen, Fuh-Gwo Chen, Jen-Ya Wang:
Enhance the Multi-level Fuzzy Association Rules Based on Cumulative Probability Distribution Approach. SNPD 2012: 89-94
2000 – 2009
- 2009
- [j3]Jen-Ya Wang, Tsui-Ping Chang, Jr-Shian Chen:
An enhanced genetic algorithm for bi-objective pump scheduling in water supply. Expert Syst. Appl. 36(7): 10249-10258 (2009) - [j2]Jen-Ya Wang, Kuen-Fang Jea:
A near-optimal database allocation for reducing the average waiting time in the grid computing environment. Inf. Sci. 179(21): 3772-3790 (2009) - 2008
- [j1]Kuen-Fang Jea, Jen-Ya Wang, Shih-Ying Chen:
A linearly convergent method for broadcast data allocation. Comput. Math. Appl. 56(2): 324-338 (2008) - [c1]Kuen-Fang Jea, Jen-Ya Wang:
An RFID Encoding Method for Supply Chain Management. APSCC 2008: 601-606
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-11-13 23:46 CET 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: