"Scheduling an unbounded batching machine with job processing time ..."

Adrien Bellanger et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2011.09.004

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/BellangerJKO12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BellangerJKO12
Adrien Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara:
Scheduling an unbounded batching machine with job processing time compatibilities. Discret. Appl. Math. 160(1-2): 15-23 (2012)

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.