Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand M. T. Lin
Bertrand Miao-Tsong Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j67]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
On scheduling of step-improving jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 75(4): 720-730 (2024)- [j66]Stanislaw Gawiejnowicz
, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Dynamic scheduling problems in theory and practice. J. Sched. 27(3): 225-226 (2024) - 2023
- [j65]Jatinder N. D. Gupta, Chin-Chia Wu, Win-Chin Lin, Xingong Zhang, Danyu Bai, Bertrand M. T. Lin, Chia-Cheng Liao:
Bicriteria single-machine scheduling with multiple job classes and customer orders. Appl. Soft Comput. 147: 110809 (2023) - 2022
- [j64]Yi-Chen Su, Bertrand M. T. Lin:
Minimizing the total weighted completion time in relocation scheduling. Comput. Ind. Eng. 173: 108662 (2022) - [j63]Xin Chen, Qian Miao, Bertrand M. T. Lin, Malgorzata Sterna, Jacek Blazewicz:
Two-machine flow shop scheduling with a common due date to maximize total early work. Eur. J. Oper. Res. 300(2): 504-511 (2022) - 2021
- [j62]Po-Chien Hao, Bertrand M. T. Lin:
Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing. Comput. Ind. Eng. 154: 107121 (2021) - [j61]Chin-Chia Wu, Jatinder N. D. Gupta, Shuenn-Ren Cheng, Bertrand M. T. Lin, Siu-Hung Yip, Win-Chin Lin:
Robust scheduling for a two-stage assembly shop with scenario-dependent processing times. Int. J. Prod. Res. 59(17): 5372-5387 (2021) - [j60]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. J. Oper. Res. Soc. 72(10): 2286-2289 (2021) - 2020
- [j59]Hui Yi Chiang, Bertrand M. T. Lin:
A Decision Model for Human Resource Allocation in Project Management of Software Development. IEEE Access 8: 38073-38081 (2020) - [j58]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
Scheduling step-deteriorating jobs to minimize the total completion time. Comput. Ind. Eng. 144: 106329 (2020) - [j57]Chia-Hui Shih, Han-Lin Li, Chih-Chien Hu, Bertrand M. T. Lin:
Forming a TED talks sphere for convenient search. Electron. Libr. 38(2): 403-420 (2020) - [j56]Alessandro Agnetis, Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Editorial: Dynamic Scheduling Problems. J. Sched. 23(6): 629-630 (2020) - 2019
- [j55]Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner, Jun-Min Wei:
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. J. Sched. 22(4): 413-431 (2019) - [j54]Alexander V. Kononov, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. Theor. Comput. Sci. 793: 70-78 (2019) - 2018
- [j53]Huai-Che Hong, Bertrand M. T. Lin:
Parallel dedicated machine scheduling with conflict graphs. Comput. Ind. Eng. 124: 316-321 (2018) - [j52]F. J. Hwang, Bertrand M. T. Lin:
Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Comput. Oper. Res. 98: 103-112 (2018) - 2017
- [j51]Bertrand M. T. Lin, F. J. Hwang, Jatinder N. D. Gupta:
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. J. Sched. 20(3): 293-302 (2017) - 2016
- [j50]Yen-Shing Tsai, Bertrand M. T. Lin:
Flow shop non-idle scheduling and resource-constrained scheduling. Ann. Oper. Res. 238(1-2): 577-585 (2016) - [j49]Chien-Nan Yang, Bertrand M. T. Lin, F. J. Hwang, Meng-Chun Wang:
Acquisition planning and scheduling of computing resources. Comput. Oper. Res. 76: 167-182 (2016) - [j48]F. J. Hwang, Bertrand M. T. Lin:
Two-stage flexible flow shop scheduling subject to fixed job sequences. J. Oper. Res. Soc. 67(3): 506-515 (2016) - [j47]Bertrand M. T. Lin, F. J. Hwang, Alexander V. Kononov:
Relocation scheduling subject to fixed processing sequences. J. Sched. 19(2): 153-163 (2016) - 2015
- [j46]Bertrand M. T. Lin:
Resource-constrained scheduling with optional recycling operations. Comput. Ind. Eng. 90: 39-45 (2015) - [j45]Alexander V. Kononov, Bertrand M. T. Lin, Kuei-Tang Fang:
Single-machine scheduling with supporting tasks. Discret. Optim. 17: 69-79 (2015) - 2014
- [j44]F. J. Hwang, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence. Ann. Oper. Res. 217(1): 263-279 (2014) - [j43]Kangbok Lee, Joseph Y.-T. Leung, Zhao-Hong Jia, Wenhua Li, Michael L. Pinedo, Bertrand M. T. Lin:
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. Eur. J. Oper. Res. 238(1): 54-64 (2014) - 2013
- [j42]Bertrand M. T. Lin, Peng-Yeng Yin, Y. S. Liu:
Sequence-dependent scheduling with order deliveries. Appl. Math. Comput. 222: 58-71 (2013) - [j41]Kuei-Tang Fang, Bertrand M. T. Lin:
Parallel-machine scheduling to minimize tardiness penalty and power cost. Comput. Ind. Eng. 64(1): 224-234 (2013) - [j40]Feng-Cheng Lin, Jen-Shin Hong, Bertrand M. T. Lin:
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1): 82-96 (2013) - 2012
- [j39]T. C. Edwin Cheng, Bertrand M. T. Lin, H. L. Huang:
Resource-constrained flowshop scheduling with separate resource recycling operations. Comput. Oper. Res. 39(6): 1206-1212 (2012) - [j38]F. J. Hwang, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discret. Optim. 9(1): 29-39 (2012) - [j37]F. J. Hwang, Bertrand M. T. Lin:
Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence. J. Oper. Res. Soc. 63(6): 839-845 (2012) - 2011
- [j36]F. J. Hwang, Bertrand M. T. Lin:
Coupled-task scheduling on a single machine subject to a fixed-job-sequence. Comput. Ind. Eng. 60(4): 690-698 (2011) - [j35]Ming-Tsung Chen, Bertrand M. T. Lin, Shian-Shyong Tseng:
Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion. Eng. Appl. Artif. Intell. 24(2): 295-305 (2011) - [j34]Bertrand M. T. Lin, F. J. Hwang:
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type. Inf. Process. Lett. 111(5): 208-212 (2011) - [j33]Sergey Sevastyanov, Bertrand M. T. Lin, Hsiao-Lan Huang:
Tight complexity analysis of the relocation problem with arbitrary release dates. Theor. Comput. Sci. 412(35): 4536-4544 (2011) - 2010
- [j32]Stanislaw Gawiejnowicz, Bertrand M. T. Lin:
Scheduling time-dependent jobs under mixed deterioration. Appl. Math. Comput. 216(2): 438-447 (2010) - [j31]Alexander V. Kononov, Bertrand M. T. Lin:
Minimizing the total weighted completion time in the relocation problem. J. Sched. 13(2): 123-129 (2010) - 2009
- [j30]Feng-Cheng Lin, Jen-Shin Hong, Bertrand M. T. Lin:
A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations. Comput. Oper. Res. 36(4): 1158-1175 (2009) - [j29]T. C. Edwin Cheng, Bertrand M. T. Lin, Y. Tian:
Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. Comput. Oper. Res. 36(11): 3031-3040 (2009) - [j28]T. C. Edwin Cheng, Bertrand M. T. Lin:
Johnson's rule, composite jobs and the relocation problem. Eur. J. Oper. Res. 192(3): 1008-1013 (2009) - 2008
- [j27]Ming-Tsung Chen, Bertrand M. T. Lin, Shian-Shyong Tseng:
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities. J. Netw. Comput. Appl. 31(1): 47-65 (2008) - 2007
- [j26]Bertrand M. T. Lin, Alexander V. Kononov:
Customer order scheduling to minimize the number of late jobs. Eur. J. Oper. Res. 183(2): 944-948 (2007) - [j25]Andy An-Kai Jeng, Bertrand M. T. Lin:
A note on parallel-machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 58(6): 824-826 (2007) - [j24]Bertrand M. T. Lin:
Complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 58(8): 1099-1102 (2007) - 2006
- [j23]Gwo-Jen Hwang, Bertrand M. T. Lin, Tsung-Liang Lin:
An effective approach for test-sheet composition with large-scale item banks. Comput. Educ. 46(2): 122-139 (2006) - [j22]Ming-Tsung Chen, Shian-Shyong Tseng, Bertrand M. T. Lin:
Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities. Comput. Commun. 29(9): 1492-1503 (2006) - [j21]Shyong Jian Shyu, Bertrand M. T. Lin, Tsung-Shen Hsiao:
Ant colony optimization for the cell assignment problem in PCS networks. Comput. Oper. Res. 33: 1713-1740 (2006) - [j20]Alexander V. Kononov, Bertrand M. T. Lin:
On relocation problems with multiple identical working crews. Discret. Optim. 3(4): 366-381 (2006) - [j19]Bertrand M. T. Lin, Hsiao-Lan Huang:
On the relocation problem with a second working crew for resource recycling. Int. J. Syst. Sci. 37(1): 27-34 (2006) - [j18]Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-machine flowshop scheduling with conditional deteriorating second operations. Int. Trans. Oper. Res. 13(2): 91-98 (2006) - 2005
- [j17]Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-Machine Flowshop Batching and Scheduling. Ann. Oper. Res. 133(1-4): 149-161 (2005) - [j16]Bertrand M. T. Lin, J. M. Wu:
A Simple Lower Bound for total Completion Time Minimization in a Two-Machine flowshop. Asia Pac. J. Oper. Res. 22(3): 391-408 (2005) - [j15]Andy An-Kai Jeng, Bertrand M. T. Lin:
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Comput. Oper. Res. 32: 521-536 (2005) - [j14]Gwo-Jen Hwang, Bertrand M. T. Lin, Hsien-Hao Tseng, Tsung-Liang Lin:
On the development of a computer-assisted testing system with genetic test sheet-generating approach. IEEE Trans. Syst. Man Cybern. Part C 35(4): 590-594 (2005) - 2004
- [j13]Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin:
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. Ann. Oper. Res. 131(1-4): 283-304 (2004) - [j12]Shyong Jian Shyu, Bertrand M. T. Lin, Peng-Yeng Yin:
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput. Ind. Eng. 47(2-3): 181-193 (2004) - [j11]T. C. Edwin Cheng, Qing Ding, Bertrand M. T. Lin:
A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152(1): 1-13 (2004) - [j10]Andy An-Kai Jeng, Bertrand M. T. Lin:
Makespan minimization in single-machine scheduling with step-deterioration of processing times. J. Oper. Res. Soc. 55(3): 247-256 (2004) - 2003
- [j9]Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin, Mohamed Haouari:
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J. Exp. Theor. Artif. Intell. 15(1): 103-112 (2003) - 2002
- [j8]Bertrand M. T. Lin:
Fabrication scheduling on a single machine with due date constraints. Eur. J. Oper. Res. 136(1): 95-105 (2002) - 2001
- [j7]Bertrand M. T. Lin, T. C. Edwin Cheng:
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Comput. Oper. Res. 28(7): 613-624 (2001) - [j6]Bertrand M. T. Lin, Y. S. Huang, H. K. Yu:
On the variable-depth-search heuristic for the linear-cost generalized assignment problem. Int. J. Comput. Math. 77(4): 535-544 (2001) - 1999
- [j5]Bertrand M. T. Lin:
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 26(7): 695-698 (1999) - [j4]Bertrand M. T. Lin, T. C. Edwin Cheng:
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints. Eur. J. Oper. Res. 116(1): 183-193 (1999) - 1997
- [j3]Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 24(12): 1169-1174 (1997) - [j2]Shian-Shyong Tseng, Bertrand M. T. Lin, Sue Huei Liu:
Construction N Latin Squares for ???. J. Inf. Sci. Eng. 13(4): 605-613 (1997) - [j1]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties. SIAM J. Optim. 7(2): 547-559 (1997)
Conference and Workshop Papers
- 2012
- [c6]Yi-Ling Wu, Tsu-Feng Ho, Shyong Jian Shyu, Bertrand M. T. Lin:
Discrete particle swarm optimization for materials acquisition in multi-unit libraries. IEEE Congress on Evolutionary Computation 2012: 1-7 - 2011
- [c5]Tsu-Feng Ho, Yi-Ling Wu, Shyong Jian Shyu, Bertrand M. T. Lin:
Applying DPSO with dynamic diversity to books selection problem. MCDM 2011: 22-28 - [c4]Sergey Sevastyanov, Bertrand M. T. Lin:
Efficient enumeration of optimal and approximate solutions of a scheduling problem. CTW 2011: 248-251 - 2010
- [c3]Tsu-Feng Ho, Shyong Jian Shyu, Yi-Ling Wu, Bertrand M. T. Lin:
Discrete Particle Swarm Optimization for Materials Budget Allocation in Academic Libraries. CSE 2010: 196-203 - [c2]Tsu-Feng Ho, Shyong Jian Shyu, Bertrand M. T. Lin, Yi-Ling Wu:
An evolutionary approach to library materials acquisition problems. IEEE Conf. of Intelligent Systems 2010: 450-455 - 1992
- [c1]Bertrand M. T. Lin, Shian-Shyong Tseng:
Resource-Requirment Minimization in Relocation Problems with Precedence Constraints. ICCI 1992: 26-29
Editorship
- 2023
- [e1]Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta:
WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings. Lecture Notes in Computer Science 13973, Springer 2023, ISBN 978-3-031-27050-5 [contents]
Informal and Other Publications
- 2022
- [i1]Yakov Zinder, Bertrand M. T. Lin, Joanna Berlinska:
Minimum-weight partitioning of a set with associated subsets. CoRR abs/2212.05823 (2022)
Coauthor Index
T. C. E. Cheng
aka: T. C. Edwin Cheng
aka: T. C. Edwin Cheng
a service of 
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-05-19 00:08 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:
