On the minimum makespan machine scheduling problem with sequence dependent setups and due dates
On the minimum makespan machine scheduling problem with sequence dependent setups and due dates
History
Language
engPublication classification
A6 Research report/technical paperCopyright notice
2005, Deakin UniversitySeries
Technical reports. Mathematics series (Deakin University. School of Information Technology) ; TR M05/01Publisher
Deakin University, School of Information TechnologyPlace of publication
Geelong, Vic.Usage metrics
Categories
No categories selectedLicence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC

