![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Liji Shen
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Stéphane Dauzère-Pérès
, Junwen Ding, Liji Shen
, Karim Tamssaouet
:
The flexible job shop scheduling problem: A review. Eur. J. Oper. Res. 314(2): 409-432 (2024) - 2023
- [j19]Söhnke Maecker, Liji Shen, Lars Mönch:
Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput. Oper. Res. 149: 105999 (2023) - [j18]Liji Shen
, Stéphane Dauzère-Pérès
, Söhnke Maecker
:
Energy cost efficient scheduling in flexible job-shop manufacturing systems. Eur. J. Oper. Res. 310(3): 992-1016 (2023) - [j17]Junwen Ding
, Stéphane Dauzère-Pérès
, Liji Shen, Zhipeng Lü:
A Novel Evolutionary Algorithm for Energy-Efficient Scheduling in Flexible Job Shops. IEEE Trans. Evol. Comput. 27(5): 1470-1484 (2023) - 2022
- [j16]Liji Shen, Stéphane Dauzère-Pérès
, Janis S. Neufeld
:
Corrigendum to: "Solving the flexible job shop scheduling problem with sequence-dependent setup times", [European Journal of Operational Research 265, 503-516, 2018]. Eur. J. Oper. Res. 296(2): 748 (2022) - 2021
- [j15]Junwen Ding
, Sven Schulz
, Liji Shen, Udo Buscher
, Zhipeng Lü:
Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Comput. Oper. Res. 125: 105088 (2021) - [j14]Lars Mönch, Liji Shen:
Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. Comput. Oper. Res. 127: 105126 (2021) - 2020
- [j13]Söhnke Maecker
, Liji Shen:
Solving parallel machine problems with delivery times and tardiness objectives. Ann. Oper. Res. 285(1): 315-334 (2020) - [j12]Junwen Ding
, Liji Shen, Zhipeng Lü, Liping Xu, Una Benlic:
A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects. IEEE Trans. Emerg. Top. Comput. Intell. 4(3): 385-397 (2020) - [c3]Lars Mönch, Liji Shen, John W. Fowler
:
Heuristics for Order-Lot Pegging In Multi-Fab Settings. WSC 2020: 1742-1752
2010 – 2019
- 2019
- [j11]Junwen Ding
, Liji Shen, Zhipeng Lü, Bo Peng:
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. Comput. Oper. Res. 103: 35-45 (2019) - [c2]Junwen Ding, Zhipeng Lü, Chu-Min Li, Liji Shen, Liping Xu, Fred W. Glover:
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem. AAAI 2019: 2262-2271 - 2018
- [j10]Liji Shen, Stéphane Dauzère-Pérès
, Janis Sebastian Neufeld
:
Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2): 503-516 (2018) - [j9]Liji Shen, Jatinder N. D. Gupta
:
Family scheduling with batch availability in flow shops to minimize makespan. J. Sched. 21(2): 235-249 (2018) - 2014
- [j8]Liji Shen:
A tabu search algorithm for the job shop problem with sequence dependent setup times. Comput. Ind. Eng. 78: 95-106 (2014) - [j7]Hongyun Xu, Zhipeng Lü, Aihua Yin, Liji Shen, Udo Buscher
:
A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 50: 47-60 (2014) - [j6]Liji Shen, Jatinder N. D. Gupta
, Udo Buscher
:
Flow shop batching and scheduling with sequence-dependent setup times. J. Sched. 17(4): 353-370 (2014) - [j5]Liji Shen, Lars Mönch, Udo Buscher
:
A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. J. Sched. 17(5): 471-487 (2014) - 2013
- [j4]Liji Shen, Lars Mönch, Udo Buscher
:
An iterative approach for the serial batching problem with parallel machines and job families. Ann. Oper. Res. 206(1): 425-448 (2013) - 2012
- [j3]Liji Shen, Udo Buscher
:
Solving the serial batching problem in job shop manufacturing systems. Eur. J. Oper. Res. 221(1): 14-26 (2012) - 2010
- [j2]Udo Buscher
, Liji Shen:
MIP formulations and heuristics for solving parallel batching problems. J. Syst. Sci. Complex. 23(5): 884-895 (2010)
2000 – 2009
- 2009
- [j1]Udo Buscher
, Liji Shen:
An integrated tabu search algorithm for the lot streaming problem in job shops. Eur. J. Oper. Res. 199(2): 385-399 (2009) - 2007
- [c1]Liji Shen:
An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment. OR 2007: 49-54
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint