"A complexity analysis and algorithms for two-machine shop scheduling ..."

Kameng Nip, Zhenbo Wang (2023)

> Home

Details and statistics

DOI: 10.1007/S10951-021-00677-8

access: closed

type: Journal Article

metadata version: 2023-12-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/NipW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/NipW23
Kameng Nip, Zhenbo Wang:
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. J. Sched. 26(6): 543-558 (2023)

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.