"A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of a ..."

Jen-Ya Wang (2019)

> Home

Details and statistics

DOI: 10.1109/ACCESS.2018.2888569

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/access/Wang19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/Wang19
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)

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.