Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard

2004

Journal of Scheduling , Volume 7 p. 333- 348

Additional Metadata
Publisher	Springer
Journal	Journal of Scheduling
Organisation	Directie
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Yu, W., Hoogeveen, J. A., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7, 333–348.

Publication