"Minimizing the makespan in the non-preemptive job-shop scheduling with ..."

Yazid Mati (2010)

> Home

Details and statistics

DOI: 10.1016/J.CIE.2010.06.010

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/candie/Mati10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/candie/Mati10
Yazid Mati:
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability. Comput. Ind. Eng. 59(4): 537-543 (2010)

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.