Computing lower and upper bounds for a large-scale industrial job shop scheduling problem

Drótos, Márton and Erdős, Ferenc Gábor and Kis, Tamás (2009) Computing lower and upper bounds for a large-scale industrial job shop scheduling problem. European Journal of Operational Research, 197 (doi: 1). pp. 296-306.

Full text not available from this repository.
Item Type: ISI Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:31
Last Modified: 11 Dec 2012 15:31
URI: http://eprints.sztaki.hu/id/eprint/5342

Update Item Update Item