"Polynomial time algorithms to find Pareto optimal schedules of bicriteria ..."

Haoxuan Shen et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.CAM.2024.116380

access: closed

type: Journal Article

metadata version: 2024-12-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcam/ShenSLP25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcam/ShenSLP25
Haoxuan Shen, Vladimir Simic, Shuguang Li, Dragan Pamucar:
Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine. J. Comput. Appl. Math. 459: 116380 (2025)

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.