On the minimum makespan machine scheduling problem with sequence dependent setups and due dates

---

Autoria(s): Ernst, Andreas; Mak, Vicky

Data(s)	01/01/2005
Identificador	http://hdl.handle.net/10536/DRO/DU:30010347
Idioma(s)	eng
Publicador	Deakin University, School of Information Technology
Direitos	2005, Deakin University
Palavras-Chave	#Traveling-salesman problem #Integer programming
Tipo	Report